File: sra-sort.h

package info (click to toggle)
sra-sdk 3.2.1%2Bdfsg-4
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 296,076 kB
  • sloc: ansic: 532,876; cpp: 243,000; perl: 9,649; python: 8,978; sh: 7,888; java: 6,253; makefile: 1,148; yacc: 703; xml: 310; lex: 236
file content (172 lines) | stat: -rw-r--r-- 4,181 bytes parent folder | download | duplicates (2)
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
/*===========================================================================
 *
 *                            PUBLIC DOMAIN NOTICE
 *               National Center for Biotechnology Information
 *
 *  This software/database is a "United States Government Work" under the
 *  terms of the United States Copyright Act.  It was written as part of
 *  the author's official duties as a United States Government employee and
 *  thus cannot be copyrighted.  This software/database is freely available
 *  to the public for use. The National Library of Medicine and the U.S.
 *  Government have not placed any restriction on its use or reproduction.
 *
 *  Although all reasonable efforts have been taken to ensure the accuracy
 *  and reliability of the software and data, the NLM and the U.S.
 *  Government do not and cannot warrant the performance or results that
 *  may be obtained by using this software or data. The NLM and the U.S.
 *  Government disclaim all warranties, express or implied, including
 *  warranties of performance, merchantability or fitness for any particular
 *  purpose.
 *
 *  Please cite the author in any work or product based on this material.
 *
 * ===========================================================================
 *
 */

#ifndef _h_sra_sort_
#define _h_sra_sort_

#ifndef _h_sra_sort_defs_
#include "sort-defs.h"
#endif

#ifndef _h_kfs_defs_
#include <kfs/defs.h>
#endif

#ifndef _h_kdb_column_
#include <kdb/column.h>
#endif


#define NEW_TYPES 1

/*--------------------------------------------------------------------------
 * forwards
 */
struct DbPair;
struct TablePair;


/*--------------------------------------------------------------------------
 * Selection
 *  input selection criteria
 */
typedef struct Selection Selection;
struct Selection
{
    int dummy;
};

/*--------------------------------------------------------------------------
 * Tool
 *  parameter block generated by KMain
 */
typedef struct Tool Tool;
struct Tool
{
    /* input selection */
    const Selection *sel;

    /* directory for temporary files */
    const char *tmpdir;

    /* directory for mmap page files */
    const char *mmapdir;

    /* source object path */
    const char *src_path;

    /* destination object path */
    const char *dst_path;

    /* buffer size for id map files */
    size_t map_file_bsize;
    size_t map_file_random_bsize;

    /* the number of ids to gather at a time */
    size_t max_ref_idx_ids;
    size_t max_large_idx_ids;
    size_t max_poslen_ids;
    size_t max_idx_ids;
    size_t min_idx_ids;

    /* the number of missing SEQUENCE ids to gather at a time */
    size_t max_missing_ids;

    /* pid of tool */
    int pid;

    /* db create mode */
    struct
    {
        KCreateMode cmode;
    } db;

    /* tbl create mode */
    struct
    {
        KCreateMode cmode;
    } tbl;

    /* column blob checksum mode */
    struct
    {
        size_t pgsize;
        KCreateMode cmode;
        KChecksum checksum;
    } col;

    /* ignore failure on multiple sorts */
    bool ignore;

    /* force overwrite */
    bool force;

    /* write new=>old mappings
       not normally needed */
    bool write_new_to_old;

    /* whether to apply a sort on old-id
       before writing old=>new mapping or
       to let pagefile handle it */
    bool sort_before_old2new;

    /* normally remove idx files right away
       but if they are being debugged... */
    bool unlink_idx_files;

    /* perform consistency check on index */
    bool idx_consistency_check;
};


/*--------------------------------------------------------------------------
 * TypeParams
 *  object type params
 */
typedef struct TypeParams TypeParams;
struct TypeParams
{
    char src_type [ 256 ];
    char dst_type [ 256 ];
    char view_type [ 256 ];
};


/*--------------------------------------------------------------------------
 * sra-sort functions
 */

/* run
 *  called from KMain
 *  determines the type of object being copied/sorted
 *  opens input object
 *  dispatches to the appropriate handler
 */
void run ( const ctx_t *ctx );

rc_t copy_stats_metadata( const char * src_path, const char * dst_path );
    
#endif