1 /* ***********************************************************
 2    *                                                         *
 3    * Copyright, (C) Honeywell Information Systems Inc., 1982 *
 4    *                                                         *
 5    * Copyright (c) 1972 by Massachusetts Institute of        *
 6    * Technology and Honeywell Information Systems, Inc.      *
 7    *                                                         *
 8    *********************************************************** */
 9 
10 
11 /* this program returns the smallest number j such that
12           j >= n
13     and   j = 0 mod m
14 
15    Initial Version:  3 April, 1969 by BLW         */
16 
17 make_mod: proc(n,m) returns(fixed bin);
18 
19 dcl       (n,j,k,m) fixed bin;
20 
21           j = n;
22           k = mod(j,m);
23           if k ^= 0 then j = j + m - k;
24           return(j);
25 
26           end;