This file is indexed.

/usr/include/recint/rusub.h is in libgivaro-dev 4.0.2-8ubuntu1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
/* ruint/arith.h - Arithmetic functions for ruint

Copyright Université Joseph Fourier - Grenoble
Contributors :
    Alexis BREUST (alexis.breust@gmail.com 2014)
	Christophe CHABOT (christophechabotcc@gmail.com 2011)
    Jean-Guillaume DUMAS

Time-stamp: <20 Jun 12 10:28:29 Jean-Guillaume.Dumas@imag.fr>

This software is a computer program whose purpose is to provide an fixed precision arithmetic library.

This software is governed by the CeCILL-B license under French law and
abiding by the rules of distribution of free software.  You can  use, 
modify and/ or redistribute the software under the terms of the CeCILL-B
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info". 

As a counterpart to the access to the source code and  rights to copy, 
modify and redistribute granted by the license, users are provided only
with a limited warranty  and the software's author,  the holder of the
economic rights,  and the successive licensors  have only  limited
liability. 

In this respect, the user's attention is drawn to the risks associated
with loading,  using,  modifying and/or developing or reproducing the
software by the user in light of its specific status of free software, 
that may mean  that it is complicated to manipulate,  and  that  also
therefore means  that it is reserved for developers  and  experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or 
data to be ensured and,  more generally, to use and operate it in the 
same conditions as regards security. 

The fact that you are presently reading this means that you have had
knowledge of the CeCILL-B license and that you accept its terms.
*/


#ifndef RUINT_ARITH_SUB_H
#define RUINT_ARITH_SUB_H

#include "ruruint.h"
#include "rucmp.h"

// --------------------------------------------------------------
// ----------------------- DEFINTIONS ---------------------------

namespace RecInt
{
    template <size_t K> ruint<K>& operator--(ruint<K>&);
    template <size_t K> ruint<K>  operator--(ruint<K>&, int);

    template <size_t K> ruint<K>& operator-=(ruint<K>&, const ruint<K>&);
    template <size_t K, typename T> __RECINT_IS_UNSIGNED(T, ruint<K>&) operator-=(ruint<K>&, const T&);
    template <size_t K, typename T> __RECINT_IS_SIGNED(T, ruint<K>&)   operator-=(ruint<K>&, const T&);

    template <size_t K> ruint<K> operator-(const ruint<K>&, const ruint<K>&);
    template <size_t K, typename T> __RECINT_IS_UNSIGNED(T, ruint<K>) operator-(const ruint<K>&, const T&);
    template <size_t K, typename T> __RECINT_IS_UNSIGNED(T, ruint<K>) operator-(const T&, const ruint<K>&);
    template <size_t K, typename T> __RECINT_IS_SIGNED(T, ruint<K>)   operator-(const ruint<K>&, const T&);
    template <size_t K, typename T> __RECINT_IS_SIGNED(T, ruint<K>)   operator-(const T&, const ruint<K>&);

    // a = b - c    or  a -= c  (a, b, c are ruint)
    // r is the borrow
    template <size_t K> void sub(bool& r, ruint<K>& a, const ruint<K>& b, const ruint<K>& c);
    template <size_t K> void sub(bool& r, ruint<K>& a, const ruint<K>& c);
    template <size_t K> ruint<K>& sub(ruint<K>& a, const ruint<K>& b, const ruint<K>& c);
    template <size_t K> ruint<K>& sub(ruint<K>& a, const ruint<K>& c);

    // a = b - c    or  a -= c  (a, b are ruint and c is integer)
    // r is the borrow
    template <size_t K, typename T> __RECINT_IS_ARITH(T, void) sub(bool& r, ruint<K>& a, const ruint<K>& b, const T& c);
    template <size_t K, typename T> __RECINT_IS_ARITH(T, void) sub(bool& r, ruint<K>& a, const T& c);
    template <size_t K, typename T> __RECINT_IS_ARITH(T, void) sub(ruint<K>& a, const ruint<K>& b, const T& c);
    template <size_t K, typename T> __RECINT_IS_ARITH(T, void) sub(ruint<K>& a, const T& c);

    // a = b - 1    or  a -= 1  (a, b are ruint)
    // r is the borrow
    template <size_t K> void sub_1(bool& r, ruint<K>& a, const ruint<K>& b);
    template <size_t K> void sub_1(bool& r, ruint<K>& a);
    template <size_t K> void sub_1(ruint<K>& a, const ruint<K>& b);
    template <size_t K> void sub_1(ruint<K>& a);

    // Mostly internal use
    template <size_t K> void sub_wc(bool& r, ruint<K>& a, const ruint<K>& b, const ruint<K>& c, const bool& cy);
    template <size_t K> void sub_wc(bool& r, ruint<K>& a, const ruint<K>& c, const bool& cy);
    template <size_t K> void sub_wc(ruint<K>& a, const ruint<K>& b, const ruint<K>& c, const bool& cy);
    template <size_t K> void sub_wc(ruint<K>& a, const ruint<K>& c, const bool& cy);
}


// --------------------------------------------------------------
// ------------------------ Operators ---------------------------

namespace RecInt
{

    // Operator --
    template <size_t K>
    inline ruint<K>& operator--(ruint<K>& a) {
        sub_1(a);
        return a;
    }
    template <size_t K>
    inline ruint<K> operator--(ruint<K>& a, int) {
        ruint<K> temp(a);
        sub_1(a);
        return temp;
    }

    // Operator -=
    template <size_t K>
    inline ruint<K>& operator-=(ruint<K>& a, const ruint<K>& b) {
        sub(a, b);
        return a;
    }
    template <size_t K, typename T>
    inline __RECINT_IS_UNSIGNED(T, ruint<K>&) operator-=(ruint<K>& a, const T& b) {
        sub(a, b);
        return a;
    }
    template <size_t K, typename T>
    inline __RECINT_IS_SIGNED(T, ruint<K>&) operator-=(ruint<K>& a, const T& b) {
        if (b < 0) add(a, -b);
        else sub(a, b);
        return a;
    }

    // Operator -
    template <size_t K>
    inline ruint<K> operator-(const ruint<K>& b, const ruint<K>& c) {
        ruint<K> a;
        sub(a, b, c);
        return a;
    }
    template <size_t K, typename T>
    inline __RECINT_IS_UNSIGNED(T, ruint<K>) operator-(const ruint<K>& b, const T& c) {
        ruint<K> a;
        sub(a, b, c);
        return a;
    }
    template <size_t K, typename T>
    inline __RECINT_IS_UNSIGNED(T, ruint<K>) operator-(const T& c, const ruint<K>& b) {
        ruint<K> a;
        sub(a, b, c);
        return -a;  
    }
    template <size_t K, typename T>
    inline __RECINT_IS_SIGNED(T, ruint<K>) operator-(const ruint<K>& b, const T& c) {
        ruint<K> a;
        if (c < 0) add(a, b, -c);
        else sub(a, b, c);
        return a;
    }
    template <size_t K, typename T>
    inline __RECINT_IS_SIGNED(T, ruint<K>) operator-(const T& c, const ruint<K>& b) {
        ruint<K> a;
        if (c < 0) add(a, b, -c);
        else sub(a, b, c);
        return -a;  
    }
}


// --------------------------------------------------------------
// ----------------------- Substraction -------------------------

namespace RecInt
{
    // Substract with ruint
    // a = b - c    (r stores the borrow)
    template <size_t K>
    inline void sub(bool& r, ruint<K>& a, const ruint<K>& b, const ruint<K>& c) {
        bool rl;
        sub(rl, a.Low, b.Low, c.Low);
        sub_wc(r, a.High, b.High, c.High, rl);
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline void sub(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const ruint<__RECINT_LIMB_SIZE+1>& c) {
        r = (b.Value < c.Value);
        a.Value = b.Value - c.Value;
    }
#else
    template<>
    inline void sub(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const ruint<__RECINT_LIMB_SIZE+1>& c) {
        r = (b < c);
        sub_ddmmss(a.High.Value, a.Low.Value, b.High.Value, b.Low.Value, c.High.Value, c.Low.Value);
    }
#endif
    template<>
    inline void sub(bool& r, ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b, const ruint<__RECINT_LIMB_SIZE>& c) {
        r = (b.Value < c.Value);
        a.Value = b.Value - c.Value;
    }

    // a -= b   (r stores the borrow)
    template <size_t K>
    inline void sub(bool& r, ruint<K>& a, const ruint<K>& b) {
        bool rl;
        sub(rl, a.Low, b.Low);
        sub_wc(r, a.High, b.High, rl);
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline void sub(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b) {
        r = (a < b);
        a.Value -= b.Value;
    }
#else
    template<>
    inline void sub(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b) {
        r = (a < b);  
        sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, b.High.Value, b.Low.Value);
    }
#endif
    template<>
    inline void sub(bool& r, ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b) {
        r = (a < b);
        a.Value -= b.Value;
    }

    // a = b - c    (the borrow is lost)
    template <size_t K>
    inline ruint<K>& sub(ruint<K>& a, const ruint<K>& b, const ruint<K>& c) {
        bool rl;
        sub(rl, a.Low, b.Low, c.Low);
        sub_wc(a.High, b.High, c.High, rl);
        return a;
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline ruint<__RECINT_LIMB_SIZE+1>& sub(ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const ruint<__RECINT_LIMB_SIZE+1>& c) {
        a.Value = b.Value - c.Value;
        return a;
    }
#else
    template<>
    inline ruint<__RECINT_LIMB_SIZE+1>& sub(ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const ruint<__RECINT_LIMB_SIZE+1>& c) {
        sub_ddmmss(a.High.Value, a.Low.Value, b.High.Value, b.Low.Value, c.High.Value, c.Low.Value);
        return a;
    }
#endif
    template<>
    inline ruint<__RECINT_LIMB_SIZE>& sub(ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b, const ruint<__RECINT_LIMB_SIZE>& c) {
        a.Value = b.Value - c.Value;
        return a;
    }

    // a -= b    (the borrow is lost)
    template <size_t K>
    inline ruint<K>& sub(ruint<K>& a, const ruint<K>& b) {
        bool rl;
        sub(rl, a.Low, b.Low);
        sub_wc(a.High, b.High, rl);
        return a;
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline ruint<__RECINT_LIMB_SIZE+1>& sub(ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b) {
        a.Value -= b.Value;
        return a;
    }
#else
    template<>
    inline ruint<__RECINT_LIMB_SIZE+1>& sub(ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b) {
        sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, b.High.Value, b.Low.Value);
        return a;
      
    }
#endif
    template<>
    inline ruint<__RECINT_LIMB_SIZE>& sub(ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b) {
        a.Value -= b.Value;
        return a;
    }


    // Substract with integer
    // a = b - c    (r stores the borrow)
    template <size_t K, typename T>
    inline __RECINT_IS_ARITH(T, void) sub(bool& r, ruint<K>& a, const ruint<K>& b, const T& c) {
        bool rl;  
        sub(rl, a.Low, b.Low, c);
        sub(r, a.High, b.High, rl);
    }
    // TODO Use __RECINT_USE_FAST_128 optim
    template <typename T>
    inline __RECINT_IS_ARITH(T, void) sub(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const T& c) {
        r = (b < c);
        sub_ddmmss(a.High.Value, a.Low.Value, b.High.Value, b.Low.Value, 0, limb(c));
    }
    template <typename T>
    inline __RECINT_IS_ARITH(T, void) sub(bool& r, ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b, const T& c) {
        r = (b.Value < limb(c));
        a.Value = b.Value - c;
    }

    // a -= b    (r stores the borrow)
    template <size_t K, typename T>
    inline __RECINT_IS_ARITH(T, void) sub(bool& r, ruint<K>& a, const T& b) {
        bool rl;
        sub(rl, a.Low, b);
        sub(r, a.High, rl);
    }
    template <typename T>
    inline __RECINT_IS_ARITH(T, void) sub(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const T& b) {
        r = (a < b);
        sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, 0, limb(b));
    }
    template <typename T>
    inline __RECINT_IS_ARITH(T, void) sub(bool& r, ruint<__RECINT_LIMB_SIZE>& a, const T& b) {
        r = (a.Value < limb(b));
        a.Value = a.Value - b;
    }

    // a = b - c    (the borrow is lost)
    template <size_t K, typename T>
    inline __RECINT_IS_ARITH(T, void) sub(ruint<K>& a, const ruint<K>& b, const T& c) {
        bool rl;  
        sub(rl, a.Low, b.Low, c);
        sub(a.High, b.High, rl);
    }
    template <typename T>
    inline __RECINT_IS_ARITH(T, void) sub(ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const T& c) {
        sub_ddmmss(a.High.Value, a.Low.Value, b.High.Value, b.Low.Value, 0, limb(c));
    }
    template <typename T>
    inline __RECINT_IS_ARITH(T, void) sub(ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b, const T& c) {
        a.Value = b.Value - limb(c);
    }

    // a -= b    (the borrow is lost)
    template <size_t K, typename T>
    inline __RECINT_IS_ARITH(T, void) sub(ruint<K>& a, const T& b) {
        bool rl;
        sub(rl, a.Low, b);
        sub(a.High, rl);
    }
    template <typename T>
    inline __RECINT_IS_ARITH(T, void) sub(ruint<__RECINT_LIMB_SIZE+1>& a, const T& b) {
        sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, 0, limb(b));
    }
    template <typename T>
    inline __RECINT_IS_ARITH(T, void) sub(ruint<__RECINT_LIMB_SIZE>& a, const T& b) {
        a.Value = a.Value - b;
    }


    // Decrement
    // a = b - 1    (r stores the borrow)
    template <size_t K>
    inline void sub_1(bool& r, ruint<K>& a, const ruint<K>& b) {
        bool rl;
        sub_1(rl, a.Low, b.Low);
        sub(r, a.High, b.High, rl);
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline void sub_1(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b) {  
        r = (b.Value == 0);
        a.Value = b.Value - 1;
    }
#else
    template<>
    inline void sub_1(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b) {  
        r = (b == 0);
        sub_ddmmss(a.High.Value, a.Low.Value, b.High.Value, b.Low.Value, 0, 1);
    }
#endif
    template<>
    inline void sub_1(bool& r, ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b) {
        r = (b.Value == 0);
        a.Value = b.Value - 1;
    }

    // a -= 1    (r stores the borrow)
    template <size_t K>
    inline void sub_1(bool& r, ruint<K>& a) {
        bool rl;
        sub_1(rl, a.Low);
        sub(r, a.High, rl);
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline void sub_1(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a) {
        r = (a.Value == 0);
        a.Value = a.Value - 1;
    }
#else
    template<>
    inline void sub_1(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a) {
        r = (a == 0);
        sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, 0, 1);
    }
#endif
    template<>
    inline void sub_1(bool& r, ruint<__RECINT_LIMB_SIZE>& a) {
        r = (a.Value == 0);
        a.Value = a.Value - 1;
    }

    // a = b - 1    (the borrow is lost)
    template <size_t K>
    inline void sub_1(ruint<K>& a, const ruint<K>& b) {
        bool rl;
        sub_1(rl, a.Low, b.Low);
        sub(a.High, b.High, rl);
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline void sub_1(ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b) { 
        a.Value = b.Value - 1;
    }
#else
    template<>
    inline void sub_1(ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b) { 
        sub_ddmmss(a.High.Value, a.Low.Value, b.High.Value, b.Low.Value, 0, 1);
    }
#endif
    template<>
    inline void sub_1(ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b) {
        a.Value = b.Value - 1;
    }

    // a -= 1    (the borrow is lost)
    template <size_t K>
    inline void sub_1(ruint<K>& a) {
        bool rl;
        sub_1(rl, a.Low);
        sub(a.High, rl);
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline void sub_1(ruint<__RECINT_LIMB_SIZE+1>& a) {
        --a.Value;
    }
#else
    template<>
    inline void sub_1(ruint<__RECINT_LIMB_SIZE+1>& a) {
        sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, 0, 1);
    }
#endif
    template<>
    inline void sub_1(ruint<__RECINT_LIMB_SIZE>& a) {
        --a.Value;
    }


    // Sub with carry
    // a = b - c - cy   (r stores the borrow, cy is 0 or 1)
    template <size_t K>
    inline void sub_wc(bool& r, ruint<K>& a, const ruint<K>& b, const ruint<K>& c, const bool& cy) {
        bool ret;
        sub_wc(ret, a.Low, b.Low, c.Low, cy);
        sub_wc(r, a.High, b.High, c.High, ret);
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline void sub_wc(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const ruint<__RECINT_LIMB_SIZE+1>& c, const bool& cy) {
        if (cy) r = (b.Value <= c.Value);
        else r = (b.Value < c.Value);
        a.Value = b.Value - c.Value - cy;
    }
#else
    template<>
    inline void sub_wc(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const ruint<__RECINT_LIMB_SIZE+1>& c, const bool& cy) {
        if (cy) r = (b <= c);
        else r = (b < c);
        sub_ddmmss(a.High.Value, a.Low.Value, b.High.Value, b.Low.Value, c.High.Value, c.Low.Value);
        if (cy) sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, 0, 1);
    }
#endif
    template<>
    inline void sub_wc(bool& r, ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b, const ruint<__RECINT_LIMB_SIZE>& c, const bool& cy) {
        if (cy) r = (b.Value <= c.Value);
        else r = (b.Value < c.Value);
        a.Value = b.Value - c.Value - cy;
    }

    // a -= b + cy   (r stores the borrow, cy is 0 or 1)
    template <size_t K>
    inline void sub_wc(bool& r, ruint<K>& a, const ruint<K>& b, const bool& cy) {
        bool ret;
        sub_wc(ret, a.Low, b.Low, cy);
        sub_wc(r, a.High, b.High, ret);
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline void sub_wc(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const bool& cy) {
        if (cy) r = (a.Value <= b.Value);
        else r = (a.Value < b.Value);
        a.Value = a.Value - b.Value - cy;
    }
#else
    template<>
    inline void sub_wc(bool& r, ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const bool& cy) {
        if (cy) r = (a <= b);
        else r = (a < b);
        sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, b.High.Value, b.Low.Value);
        if (cy) sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, 0, 1);
    }
#endif
    template<>
    inline void sub_wc(bool& r, ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b, const bool& cy) {
        if (cy) r = (a.Value <= b.Value);
        else r = (a.Value < b.Value);
        a.Value = a.Value - b.Value - cy;
    }

    // a = b - c - cy   (the borrow is lost, cy is 0 or 1)
    template <size_t K>
    inline void sub_wc(ruint<K>& a, const ruint<K>& b, const ruint<K>& c, const bool& cy) {
        bool ret;
        sub_wc(ret, a.Low, b.Low, c.Low, cy);
        sub_wc(a.High, b.High, c.High, ret);
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline void sub_wc(ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const ruint<__RECINT_LIMB_SIZE+1>& c, const bool& cy) {
        a.Value = b.Value - c.Value - cy;
    }
#else
    template<>
    inline void sub_wc(ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const ruint<__RECINT_LIMB_SIZE+1>& c, const bool& cy) {
        sub_ddmmss(a.High.Value, a.Low.Value, b.High.Value, b.Low.Value, c.High.Value, c.Low.Value);
        sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, 0, cy);
    }
#endif
    template<>
    inline void sub_wc(ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b, const ruint<__RECINT_LIMB_SIZE>& c, const bool& cy) {
        a.Value = b.Value - c.Value - cy;
    }

    // a -= b + cy   (the borrow is lost, cy is 0 or 1)
    template <size_t K>
    inline void sub_wc(ruint<K>& a, const ruint<K>& b, const bool& cy) {
        bool ret;
        sub_wc(ret, a.Low, b.Low, cy);
        sub_wc(a.High, b.High, ret);
    }
#if defined(__RECINT_USE_FAST_128)
    template<>
    inline void sub_wc(ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const bool& cy) {
        a.Value = a.Value - b.Value - cy;
    }
#else
    template<>
    inline void sub_wc(ruint<__RECINT_LIMB_SIZE+1>& a, const ruint<__RECINT_LIMB_SIZE+1>& b, const bool& cy) {
        sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, 0, cy);
        sub_ddmmss(a.High.Value, a.Low.Value, a.High.Value, a.Low.Value, b.High.Value, b.Low.Value);
    }
#endif
    template<>
    inline void sub_wc(ruint<__RECINT_LIMB_SIZE>& a, const ruint<__RECINT_LIMB_SIZE>& b, const bool& cy) {
        a.Value = a.Value - b.Value - cy;
    }
}

#endif