This file is indexed.

/usr/lib/ats2-postiats-0.2.6/libats/DATS/lindeque_dllist.dats is in ats2-lang 0.2.6-2.

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
(***********************************************************************)
(*                                                                     *)
(*                         Applied Type System                         *)
(*                                                                     *)
(***********************************************************************)

(*
** ATS/Postiats - Unleashing the Potential of Types!
** Copyright (C) 2011-2013 Hongwei Xi, ATS Trustful Software, Inc.
** All rights reserved
**
** ATS is free software;  you can  redistribute it and/or modify it under
** the terms of  the GNU GENERAL PUBLIC LICENSE (GPL) as published by the
** Free Software Foundation; either version 3, 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, please write to the
** Free Software Foundation,  51 Franklin Street, Fifth Floor, Boston, MA
** 02110-1301, USA.
*)

(* ****** ****** *)

staload
UN = "prelude/SATS/unsafe.sats"
// end of [staload]

(* ****** ****** *)

#define nullp the_null_ptr

(* ****** ****** *)

staload "libats/SATS/gnode.sats"

(* ****** ****** *)

staload "libats/SATS/dllist.sats"
staload "libats/DATS/dllist.dats"

(* ****** ****** *)

staload "libats/SATS/lindeque_dllist.sats"

(* ****** ****** *)
//
extern
castfn
deque_encode
  : {a:vt0p}{n:int} (g2node0 (INV(a))) -<> deque (a, n)
extern
castfn
deque_decode
  : {a:vt0p}{n:int} (deque (INV(a), n)) -<> g2node0 (a)
//
extern
castfn
deque1_encode
  : {a:vt0p}{n:int | n > 0} (g2node1 (INV(a))) -<> deque (a, n)
extern
castfn
deque1_decode
  : {a:vt0p}{n:int | n > 0} (deque (INV(a), n)) -<> g2node1 (a)
//
(* ****** ****** *)

implement{}
lindeque_nil{a} () = $UN.castvwtp0{deque(a,0)}(nullp)

(* ****** ****** *)
//
implement{}
lindeque_is_nil{a}{n} (dq) =
  $UN.cast{bool(n==0)}($UN.castvwtp1{ptr}(dq) = nullp)
//
implement{}
lindeque_isnot_nil{a}{n} (dq) =
  $UN.cast{bool(n > 0)}($UN.castvwtp1{ptr}(dq) > nullp)
//
(* ****** ****** *)

implement{a}
lindeque_length {n} (dq) = let
//
fun loop
(
  nxs: g2node1 (a), p0: ptr, n: int
) : int = let
  val nxs2 = gnode_get_next (nxs)
  val nxs2 = $UN.cast{g2node1(a)}(nxs2)
in
//
if p0 != gnode2ptr (nxs2) then loop (nxs2, p0, n+1) else n
//
end // end of [loop]
//
prval () = lemma_deque_param (dq)
val isnot = lindeque_isnot_nil (dq)
//
in
//
if isnot then let
  val nxs = $UN.castvwtp1{g2node1(a)}(dq)
  val len = $effmask_all (loop (nxs, gnode2ptr (nxs), 1))
in
  $UN.cast{int(n)}(len)
end else (0) // end of [if]
//
end // end of [lindeque_length]

(* ****** ****** *)

implement{a}
lindeque_insert_at
  (dq, i, x) = let
//
val nx0 =
  g2node_make_elt<a> (x) in lindeque_insert_at_ngc (dq, i, nx0)
//
end // end of [lindeque_insert_at]

implement{a}
lindeque_insert_atbeg
  (dq, x) = let
//
val nx0 =
  g2node_make_elt<a> (x) in lindeque_insert_atbeg_ngc (dq, nx0)
//
end // end of [lindeque_insert_atbeg]

implement{a}
lindeque_insert_atend
  (dq, x) = let
//
val nx0 =
  g2node_make_elt<a> (x) in lindeque_insert_atend_ngc (dq, nx0)
//
end // end of [lindeque_insert_atend]

(* ****** ****** *)

implement{a}
lindeque_takeout_at
  (dq, i) = let
//
val nx = lindeque_takeout_at_ngc (dq, i) in g2node_getfree_elt (nx)
//
end // end of [lindeque_takeout_at]

implement{a}
lindeque_takeout_atbeg
  (dq) = let
//
val nx = lindeque_takeout_atbeg_ngc (dq) in g2node_getfree_elt (nx)
//
end // end of [lindeque_takeout_atbeg]

implement{a}
lindeque_takeout_atend
  (dq) = let
//
val nx = lindeque_takeout_atend_ngc (dq) in g2node_getfree_elt (nx)
//
end // end of [lindeque_takeout_atend]

(* ****** ****** *)

implement{a}
lindeque2dllist {n} (dq) = let
//
val nxs = deque_decode (dq)
val isnot = gnode_isnot_null (nxs)
//
val () =
if isnot then
{
  val nxs2 = gnode_get_prev (nxs)
  val nxs2 = $UN.cast{g2node1(a)}(nxs2)
  val () = gnode_set_prev_null (nxs)
  val () = gnode_set_next_null (nxs2)
} // end of [if]
in
  $UN.castvwtp0{dllist(a,0,n)}(nxs)
end // end of [lindeque2dllist]

(* ****** ****** *)
//
// HX: ngc-functions should not involve malloc/free!
//
(* ****** ****** *)

implement{a}
lindeque_insert_atbeg_ngc
  (dq, nx0) = let
//
val nxs = deque_decode (dq)
val isnul = gnode_is_null (nxs)
//
in
//
if isnul then let
  val () = gnode_link11 (nx0, nx0)
in
  dq := deque_encode (nx0)
end else let
  val () = gnode_insert_prev (nxs, nx0)
in
  dq := deque_encode (nx0)
end // end of [if]
//
end // end of [lindeque_insert_atbeg_ngc]

(* ****** ****** *)

implement{a}
lindeque_insert_atend_ngc
  (dq, nx0) = let
//
val nxs = deque_decode (dq)
val isnul = gnode_is_null (nxs)
//
in
//
if isnul then let
  val () = gnode_link11 (nx0, nx0)
in
  dq := deque_encode (nx0)
end else let
  val () = gnode_insert_prev (nxs, nx0)
in
  dq := deque_encode (nxs)
end // end of [if]
//
end // end of [lindeque_insert_atend_ngc]

(* ****** ****** *)

implement{a}
lindeque_takeout_atbeg_ngc
  (dq) = let
//
val nxs = deque1_decode (dq)
val nxs2 = gnode_get_next (nxs)
//
val p = gnode2ptr (nxs)
val p2 = gnode2ptr (nxs2)
//
val nxs = gnode_remove (nxs)
//
in
//
if (p != p2) then let
  val () = dq := deque_encode (nxs2) in nxs
end else let
  val () = dq := deque_encode (gnode_null ()) in nxs
end // end of [if]
//
end // end of [lindeque_takeout_atbeg_ngc]

(* ****** ****** *)

implement{a}
lindeque_takeout_atend_ngc
  (dq) = let
//
val nxs = deque1_decode (dq)
val nxs2 = gnode_remove_prev (nxs)
val nxs2 = $UN.cast{g2node1(a)}(nxs2)
//
val p = gnode2ptr (nxs)
val p2 = gnode2ptr (nxs2)
//
in
//
if (p != p2) then let
  val () = dq := deque_encode (nxs) in nxs2
end else let
  val () = dq := deque_encode (gnode_null ()) in nxs2
end // end of [if]
//
end // end of [lindeque_takeout_atend_ngc]

(* ****** ****** *)

(* end of [lindeque_dllist.dats] *)