Searched refs:partition (Results 1 - 9 of 9) sorted by relevance
/ast/src/lib/libpz/ |
H A D | pzhead.c | 56 (*pz->disc->errorf)(pz, pz->disc, -1, "%s: pzheadread: f=%08x i=%02x n=%02x partition=%s%s", pz->path, pz->flags, i, n, pz->disc->partition, s ? "" : " (nil)"); 92 else if ((n = pzfixed(pz, pz->io, NiL, 0)) <= 0 && pz->disc->partition) 95 if (!pzpartition(pz, pz->disc->partition)) 102 if (!(pz->flags & PZ_DELAY) && (pz->disc->partition || !(pz->flags & PZ_FORCE))) 239 sfprintf(op, "# pzip %d.%d partition\n", pz->major, pz->minor);
|
H A D | sfdczip.c | 42 * pzip [--[no]crc] [--] [ partition ] 190 if ((sfset(sp, 0, 0) & SF_WRITE) && !(disc.partition = part)) 192 mesg = ERROR_dictionary("partition file operand required");
|
H A D | sfdcpzip.c | 201 pz->disc.partition = disc->partition;
|
H A D | pzopen.c | 184 if ((pz->flags & (PZ_READ|PZ_SPLIT|PZ_STAT)) || !disc->partition) 188 if ((pz->flags & PZ_SPLIT) && disc->partition && pzpartition(pz, disc->partition)) 195 if (disc->partition && pzpartition(pz, disc->partition))
|
H A D | pzip.h | 46 #define PZ_PART_SUF "prt" /* partition file suffix */ 57 #define PZ_PARTITION 4 /* new partition event */ 127 const char* name; /* format (partition) name */ 146 const char* partition; /* data partition file */ member in struct:Pzdisc_s 152 Pzread_f readf; /* partition row read function */ 153 Pzwrite_f writef; /* partition row write function */ 166 struct Pzpart_s /* partition context */ 168 char* name; /* partition name */ 222 Pzpart_t* part; /* current partition */ [all...] |
H A D | pzpart.c | 23 * partition support 53 * return partition pointer given name 66 * partition iterator 67 * return the next partition after pp 81 * set the current partition to pp 82 * old partition returned 225 * initialize the partition map from pp.{<map,nmap>,<grp,ngrp>} 268 * initialize the partition workspace 287 (*pz->disc->errorf)(pz, pz->disc, 2, "%s: partition header corrupted", pz->path); 374 * the discipline functions may change the partition nam 688 pzpartition(register Pz_t* pz, const char* partition) argument [all...] |
/ast/src/cmd/pzip/ |
H A D | pop.c | 31 " It can cut high or low frequency partition columns, list format field" 32 " names for partition columns, and list the partition column frequencies." 43 " Names are used to label partition group listings on the standard" 44 " output, with partition groups separated by an empty line.]:[file]" 50 "[m:map?List the partition file with the row size equal to the number of" 52 " in order from 0. This partition file can then be used on high" 55 "[o:override?Override the column partition. Currently only fixed value" 61 " fixed values (see the \b--partition\b option).]:[name=value]" 62 "[p:partition [all...] |
H A D | pzip.c | 29 "[+NAME?\f?\f - fixed record partition compress/decompress]" 38 " (see the \b--partition\b option below) before being passed to" 41 " The \agzip\a tables are flushed between each column partition group." 50 " \apzip\a files self-identify; the row size and partition can be" 55 " [+(2)?If the \b--partition\b option is specified then the" 83 " This output is compatible with the \b--partition\b file format.]" 100 "[o:override?Override the column partition. Currently only fixed value" 106 " fixed values (see the \b--partition\b option).]:[begin[-end]]=value]" 107 "[p:partition?\afile\a specifies the data row size and the high frequency" 108 " column partition group [all...] |
H A D | pin.c | 27 * induce a column partition on fixed row data 33 "[+NAME?pin - induce a pzip partition on fixed record data]" 34 "[+DESCRIPTION?\bpin\b induces a \bpzip\b(1) column partition on data files" 35 " of fixed length rows (records) and columns (fields). If a partition" 36 " file is specified then that partition is refined. A partition file," 42 " [+(1)?If \b--partition\b is not specified then a" 53 " [+(3)?The optimal partition for the ordering from step (2) is" 72 "[g:group?Sets the maximum number of columns in any partition group. Lower" 76 " columns in the partition 267 partition(int i) function 1466 char* partition = 0; local [all...] |
Completed in 48 milliseconds