/usr/lib/ats-anairiats-0.2.11/libats/DATS/linbitvec.dats is in ats-lang-anairiats 0.2.11-1build1.
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 | (***********************************************************************)
(* *)
(* Applied Type System *)
(* *)
(* Hongwei Xi *)
(* *)
(***********************************************************************)
(*
** ATS - Unleashing the Potential of Types!
** Copyright (C) 2002-2010 Hongwei Xi, Boston University
** All rights reserved
**
** ATS is free software; you can redistribute it and/or modify it under
** the terms of the GNU General Public License as published by the Free
** Software Foundation; either version 2.1, or (at your option) any later
** version.
**
** ATS is distributed in the hope that it will be useful, but WITHOUT ANY
** WARRANTY; without even the implied warranty of MERCHANTABILITY or
** FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
** for more details.
**
** You should have received a copy of the GNU General Public License
** along with ATS; see the file COPYING. If not, write to the Free
** Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
** 02110-1301, USA.
*)
(* ****** ****** *)
#define ATS_DYNLOADFLAG 0 // no dynamic loading
(* ****** ****** *)
staload "libats/SATS/linbitvec.sats"
(* ****** ****** *)
implement bitvec_isnot_nil (vec, n) = ~bitvec_is_nil (vec, n)
implement bitvec_isnot_all (vec, n) = ~bitvec_is_all (vec, n)
(* ****** ****** *)
implement bitvec_notequal (vec1, vec2, n) = ~bitvec_equal (vec1, vec2, n)
(* ****** ****** *)
%{^
//
// declared in [string.h]
//
#ifndef memset
extern void *memset (void *buf, int chr, size_t n) ;
#endif
//
ats_ptr_type
atslib_linbitvec_bitvec_make
(ats_size_type nbit) {
uintptr_t *p_vec ; size_t nwrd ;
nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
p_vec = ATS_CALLOC (nwrd, NBYTE_PER_WORD) ; // initialized to zero
return p_vec ;
} // end of [atslib_linbitvec_bitvec_make]
//
ats_ptr_type // HX: same as [atslib_linbitvec_bitvec_make] for now
atslib_linbitvec_bitvec_make_nil
(ats_size_type nbit) {
uintptr_t *p_vec ; size_t nwrd ;
nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
p_vec = ATS_CALLOC (nwrd, NBYTE_PER_WORD) ; // initialized to zero
return p_vec ;
} // end of [atslib_linbitvec_bitvec_make_nil]
//
ats_ptr_type
atslib_linbitvec_bitvec_make_all
(ats_size_type nbit) {
uintptr_t *p_vec, zc; size_t nwrd ; int next ;
nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
next = (nwrd << NBIT_PER_WORD_LOG) - nbit ; // extra bits
p_vec = ATS_CALLOC (nwrd, NBYTE_PER_WORD) ; // initialized to zero
memset (p_vec, 0xFF, nwrd * NBYTE_PER_WORD) ;
/*
** extra bits, which are in the front, must be set to zero!!!
*/
if (nwrd > 0) { zc = ~0; p_vec[nwrd-1] &= (zc >> next) ; }
return p_vec ;
} // end of [atslib_linbitvec_bitvec_make_all]
//
ats_void_type
atslib_linbitvec_bitvec_free
(ats_ptr_type p_vec) { ATS_FREE (p_vec) ; return ; }
// end of [atslib_linbitvec_bitvec_free]
//
%} // end of [%{^]
(* ****** ****** *)
%{^
//
ats_bool_type
atslib_linbitvec_bitvec_is_nil (
ats_ptr_type p0, ats_size_type nbit
) {
int nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
uintptr_t *p = p0 ;
if (!nwrd) return ats_true_bool ;
if (*p != 0) return ats_false_bool ;
while (--nwrd > 0) { if (*++p != 0) return ats_false_bool ; }
return ats_true_bool ;
} // end of [atslib_linbitvec_bitvec_is_nil]
//
ats_bool_type
atslib_linbitvec_bitvec_is_all (
ats_ptr_type p0, ats_size_type nbit
) {
int nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
int next = (nwrd << NBIT_PER_WORD_LOG) - nbit ; // extra bits
uintptr_t *p = p0, zc = ~0 ;
while (nwrd > 1) {
if (*p != zc) return ats_false_bool ; --nwrd ; ++p ;
} ;
/*
** extra bits, which are in the front, must be zero!!!
*/
if (nwrd) { if (*p != (zc >> next)) return ats_false_bool ; } ;
return ats_true_bool ;
} // end of [atslib_linbitvec_bitvec_is_all]
//
%} // end of [%{^]
(* ****** ****** *)
%{^
//
ats_bool_type
atslib_linbitvec_bitvec_equal (
ats_ptr_type p10, ats_ptr_type p20, ats_size_type nbit
) {
int nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
uintptr_t *p1 = p10, *p2 = p20 ;
if (!nwrd) return ats_true_bool ;
if (*p1 != *p2) return ats_false_bool ;
while (--nwrd > 0) { if (*++p1 != *++p2) return ats_false_bool ; } ;
return ats_true_bool ;
} // end of [atslib_linbitvec_bitvec_copy]
//
%} // end of [%{^]
(* ****** ****** *)
%{^
//
ats_void_type
atslib_linbitvec_bitvec_copy (
ats_ptr_type p10, ats_ptr_type p20, ats_size_type nbit
) {
int nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
uintptr_t *p1 = p10, *p2 = p20 ;
if (!nwrd) return ;
*p1 = *p2 ; while (--nwrd > 0) { *(++p1) = *(++p2) ; }
return ;
} // end of [atslib_linbitvec_bitvec_copy]
//
%} // end of [%{^]
(* ****** ****** *)
%{^
//
ats_void_type
atslib_linbitvec_bitvec_neg (
ats_ptr_type p0, ats_size_type nbit
) {
int nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
int next = (nwrd << NBIT_PER_WORD_LOG) - nbit ; // extra bits
uintptr_t *p = p0, zc = ~0 ;
while (nwrd > 1) {
*p = ~(*p) ; --nwrd ; ++p ;
}
/*
** extra bits, which are in the front, must be set to zero!!!
*/
if (nwrd > 0) { *p = ~(*p) ; *p &= (zc >> next) ; }
return ;
} // end of [atslib_linbitvec_bitvec_neg]
//
ats_void_type
atslib_linbitvec_bitvec_or (
ats_ptr_type p10, ats_ptr_type p20, ats_size_type nbit
) {
int nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
uintptr_t *p1 = p10, *p2 = p20 ;
if (!nwrd) return ;
*p1 |= *p2 ; while (--nwrd > 0) { *(++p1) |= *(++p2) ; }
return ;
} // end of [atslib_linbitvec_bitvec_or]
//
ats_void_type
atslib_linbitvec_bitvec_and (
ats_ptr_type p10, ats_ptr_type p20, ats_size_type nbit
) {
int nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
uintptr_t *p1 = p10, *p2 = p20 ;
if (!nwrd) return ;
*p1 &= *p2 ; while (--nwrd > 0) { *(++p1) &= *(++p2) ; }
return ;
} // end of [atslib_linbitvec_bitvec_and]
//
ats_void_type
atslib_linbitvec_bitvec_xor ( // symmetric difference
ats_ptr_type p10, ats_ptr_type p20, ats_size_type nbit
) {
int nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
uintptr_t *p1 = p10, *p2 = p20 ;
if (!nwrd) return ;
*p1 ^= *p2 ; while (--nwrd > 0) { *(++p1) ^= *(++p2) ; }
return ;
} // end of [atslib_linbitvec_bitvec_xor]
//
ats_void_type
atslib_linbitvec_bitvec_diff ( // difference
ats_ptr_type p10, ats_ptr_type p20, ats_size_type nbit
) {
int nwrd = (nbit + NBIT_PER_WORD - 1) >> NBIT_PER_WORD_LOG ;
uintptr_t *p1 = p10, *p2 = p20 ;
if (!nwrd) return ;
*p1 &= ~(*p2) ; while (--nwrd > 0) { *(++p1) &= ~(*(++p2)) ; }
return ;
} // end of [atslib_linbitvec_bitvec_diff]
//
%} // end of [%{^]
(* ****** ****** *)
(* end of [linbitvec.dats] *)
|