This file is indexed.

/usr/include/biosquid/sre_stack.h is in libsquid-dev 1.9g+cvs20050121-10.

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
/* sre_stack.h
 *
 * Pushdown stack implementations, for integers, for objects, and characters.
 *
 * nstack - SRE 1 March 2000. [Seattle]
 * mstack - SRE, Fri Oct 10 10:18:16 2003 [St. Louis]
 * cstack - SRE, Mon Oct 13 12:57:56 2003 [St. Louis]
 *
 * CVS $Id: sre_stack.h,v 1.3 2003/10/13 23:07:56 eddy Exp $
 *****************************************************************
 * SQUID - a library of functions for biological sequence analysis
 * Copyright (C) 1992-2002 Washington University School of Medicine
 * 
 *     This source code is freely distributed under the terms of the
 *     GNU General Public License. See the files COPYRIGHT and LICENSE
 *     for details.
 *****************************************************************
 */
#ifndef SRE_STACKH_INCLUDED
#define SRE_STACKH_INCLUDED

typedef struct nstack_s {
  int *data;			/* the data stack                           */
  int  n;			/* current (topmost) elem in data           */
  int  nalloc;			/* # of elems allocated right now           */
  int  memblock;		/* memory allocation block size, # of elems */
} Nstack_t;

typedef struct mstack_s {
  void **data;			/* the data stack                           */
  int    n;			/* current (topmost) elem in data           */
  int    nalloc;		/* # of elems allocated right now           */
  int    memblock;		/* memory allocation block size, # of elems */
} Mstack_t;

typedef struct cstack_s {
  char  *data;			/* the data stack                           */
  int    n;			/* current (topmost) elem in data           */
  int    nalloc;		/* # of elems allocated right now           */
  int    memblock;		/* memory allocation block size, # of elems */
} Cstack_t;

extern Nstack_t *CreateNstack(void);
extern int       PushNstack(Nstack_t *ns, int x);
extern int       PopNstack(Nstack_t *ns,  int *ret_x);
extern void      FreeNstack(Nstack_t *ns);
extern int       NstackIsEmpty(Nstack_t *ns);
extern void      NstackSetBlocksize(Nstack_t *ns, int newsize);

extern Mstack_t *CreateMstack(void);
extern int       PushMstack(Mstack_t *ms, void *obj);
extern void     *PopMstack(Mstack_t *ms);
extern void      FreeMstack(Mstack_t *ms);
extern int       MstackIsEmpty(Mstack_t *ms);
extern void      MstackSetBlocksize(Mstack_t *ms, int newsize);

extern Cstack_t *CreateCstack(void);
extern int       PushCstack(Cstack_t *cs, char c);
extern int       PopCstack(Cstack_t *cs, char *ret_c);
extern void      FreeCstack(Cstack_t *cs);
extern int       CstackIsEmpty(Cstack_t *cs);
extern void      CstackSetBlocksize(Cstack_t *cs, int newsize);
extern char     *CstackString(Cstack_t *cs);

#endif /*SRE_STACKH_INCLUDED*/