input stringlengths 16 454k | output stringlengths 13 350k | function_name stringlengths 1 100 | repo_name stringlengths 6 43 | category stringclasses 76
values | sample_id stringlengths 22 88 | decompiler stringclasses 1
value | opt_level stringclasses 1
value |
|---|---|---|---|---|---|---|---|
bool __cdecl KasumiString::isCommentLine(KasumiString *const this) {
return std::string::find(this, "#", 0) == 0;
} | bool KasumiString::isCommentLine() {
if (find("#", 0) == 0) {
return true;
}
return false;
} | isCommentLine | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
bool __cdecl KasumiString::isEmptyLine(KasumiString *const this) {
return std::string::length(this) == 0;
} | bool KasumiString::isEmptyLine() {
if (length() == 0) {
return true;
}
return false;
} | isEmptyLine | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
bool __cdecl KasumiString::isEntryLine(KasumiString *const this) {
std::string::size_type i;
i = std::string::find(this, asc_259E8, 0);
return i != -1 && std::string::find(this, asc_259E8, i + 1) != -1;
} | bool KasumiString::isEntryLine() {
string::size_type i;
i = find(" ", 0);
if (i == npos) {
return false;
}
i = find(" ", i + 1);
if (i == npos) {
return false;
}
return true;
} | isEntryLine | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
bool __cdecl isInt(const std::string *str) {
unsigned int i;
unsigned int ia;
if (std::operator == <char>(str, (const char *)&asc_259E8[2]) ||
std::operator == <char>(str, &byte_259EE))
return 0;
if (std::operator == <char>(str, "0"))
return 1;
i = *(_BYTE *)std::string::c_str(str) == 45;
if ... | bool isInt(const string &str) {
unsigned int i;
if (str == "-" || str == "") {
return false;
}
if (str == "0") {
return true;
}
if (str.c_str()[0] == '-') {
i = 1;
} else {
i = 0;
}
if (str.c_str()[i] >= '1' && str.c_str()[i] <= '9') {
for (i++; i < str.length(); i++) {
i... | isInt | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
bool __cdecl KasumiString::isKeyValLine(KasumiString *const this) {
return std::string::find(this, &asc_259E8[1], 0) != -1;
} | bool KasumiString::isKeyValLine() {
string::size_type i;
i = find("=", 0);
if (i == npos) {
return false;
}
return true;
} | isKeyValLine | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
int __fastcall main(int argc, const char **argv, const char **envp) {
KasumiConfiguration *v4;
KasumiDic *v5;
__gnu_cxx::__enable_if<true, bool>::__type v6;
__gnu_cxx::__enable_if<true, bool>::__type v7;
KasumiMainWindow *v8;
__gnu_cxx::__enable_if<true, bool>::__type v9;
__gnu_cxx::__enable_if<true, bool... | int main(int argc, char *argv[]) {
gtk_init(&argc, &argv);
#ifdef ENABLE_NLS
setlocale(LC_ALL, "");
bindtextdomain(PACKAGE, LOCALEDIR);
bind_textdomain_codeset(PACKAGE, "UTF-8");
textdomain(PACKAGE);
#endif
GtkWidget *server = check_duplicated_process(argc, argv);
if (!server)
return 0;
try {
... | main | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
gboolean onButtonPress(GtkWidget *spinbutton, GdkEventButton *bevent,
gpointer data) {
return bevent->button == 1 && (bevent->type == GDK_2BUTTON_PRESS ||
bevent->type == GDK_3BUTTON_PRESS);
} | static gboolean onButtonPress(GtkWidget *spinbutton, GdkEventButton *bevent,
gpointer data) {
if (bevent->button == 1 && (bevent->type == GDK_2BUTTON_PRESS ||
bevent->type == GDK_3BUTTON_PRESS)) {
return TRUE;
}
return FALSE;
} | onButtonPress | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void __cdecl KasumiMainWindow::pressedKeyOnTextColumn(
KasumiMainWindow *const this, GtkWidget *widget, GdkEventKey *event) {
this->lastKeyState = event->state;
this->lastKeyVal = event->keyval;
} | void KasumiMainWindow::pressedKeyOnTextColumn(GtkWidget *widget,
GdkEventKey *event) {
lastKeyState = event->state;
lastKeyVal = event->keyval;
} | pressedKeyOnTextColumn | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void __cdecl KasumiMainWindow::refresh(KasumiMainWindow *const this) {
__int64 type;
__int64 v3;
unsigned int ID;
std::list<KasumiWord *>::iterator p;
std::_List_iterator<KasumiWord *>::_Self __y;
GtkTreeModel *model;
KasumiWord *word;
GtkTreeIter iter;
std::string v10;
KasumiException e;
std::str... | void KasumiMainWindow::refresh() {
GtkTreeModel *model = GTK_TREE_MODEL(SortList);
GtkTreeIter iter;
gtk_list_store_clear(WordList);
list<KasumiWord *>::iterator p = dictionary->firstWordIter();
while (p != dictionary->endWordIter()) {
try {
KasumiWord *word = (*p);
if (word != NULL && word... | refresh | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void __cdecl KasumiMainWindow::registerCallbackFunctions(
KasumiMainWindow *const this) {
__int64 v1;
__int64 v2;
__int64 v3;
__int64 v4;
__int64 v5;
__int64 v6;
__int64 v7;
v1 = g_type_check_instance_cast(this->mWindow, 80);
g_signal_connect_data(v1, "delete_event", _call_back_delete_event, this... | void KasumiMainWindow::registerCallbackFunctions() {
g_signal_connect(G_OBJECT(mWindow), "delete_event",
G_CALLBACK(_call_back_delete_event), this);
g_signal_connect(G_OBJECT(mQuitButton), "clicked",
G_CALLBACK(_call_back_quit), this);
g_signal_connect(G_OBJECT(mSaveButton)... | registerCallbackFunctions | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void __cdecl KasumiDic::removeWord(KasumiDic *const this, unsigned int id) {
KasumiWord *const *v2;
KasumiWord *const *v3;
void **v4;
size_t v5;
std::vector<KasumiDicEventListener *>::reference v6;
int flag;
std::list<KasumiWord *>::iterator p;
std::_List_iterator<KasumiWord *>::_Self __y;
size_t i;
... | void KasumiDic::removeWord(unsigned int id) {
int flag = 0;
list<KasumiWord *>::iterator p = mWordList.begin();
while (p != mWordList.end()) {
if ((*p)->getID() == id) {
mWordList.erase(p);
(*p)->removeEventListener(this);
free(*p);
flag = 1;
break;
}
p++;
}
if (fla... | removeWord | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void __cdecl KasumiWord::setFrequency(KasumiWord *const this, int aFrequency) {
std::vector<KasumiWordEventListener *>::reference v2;
size_t i;
if (aFrequency != this->Frequency) {
this->Frequency = aFrequency;
for (i = 0; i < std::vector<KasumiWordEventListener *>::size(
&this->E... | void KasumiWord::setFrequency(int aFrequency) {
if (aFrequency == Frequency)
return;
Frequency = aFrequency;
for (size_t i = 0; i < EventListeners.size(); i++) {
EventListeners[i]->changedFrequency(this);
}
} | setFrequency | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void __cdecl KasumiWord::setSpelling(KasumiWord *const this,
const std::string *aSpelling) {
std::vector<KasumiWordEventListener *>::reference v2;
size_t i;
std::string v4;
unsigned __int64 v5;
v5 = __readfsqword(0x28u);
if (!std::operator == <char>(aSpelling, &this->Sp... | void KasumiWord::setSpelling(const string &aSpelling) {
if (aSpelling == Spelling)
return;
Spelling = aSpelling;
Spelling_UTF8 = IsEUCJP ? convertEUCJPToUTF8(Spelling) : Spelling;
for (size_t i = 0; i < EventListeners.size(); i++) {
EventListeners[i]->changedSpelling(this);
}
} | setSpelling | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void __cdecl KasumiWord::setSpellingByUTF8(KasumiWord *const this,
const std::string *aSpelling) {
std::vector<KasumiWordEventListener *>::reference v2;
size_t i;
std::string v4;
unsigned __int64 v5;
v5 = __readfsqword(0x28u);
if (!std::operator == <char>(aSpellin... | void KasumiWord::setSpellingByUTF8(const string &aSpelling) {
if (aSpelling == Spelling_UTF8)
return;
Spelling_UTF8 = aSpelling;
Spelling = IsEUCJP ? convertUTF8ToEUCJP(Spelling_UTF8) : Spelling_UTF8;
for (size_t i = 0; i < EventListeners.size(); i++) {
EventListeners[i]->changedSpelling(this);
}
} | setSpellingByUTF8 | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void __cdecl KasumiWord::setWordType(KasumiWord *const this,
KasumiWordType *aType) {
std::vector<KasumiWordEventListener *>::reference v2;
size_t i;
if (!KasumiWordType::equal(aType, this->mWordType)) {
this->mWordType = aType;
for (i = 0; i < std::vector<KasumiWordE... | void KasumiWord::setWordType(KasumiWordType *aType) {
if (aType->equal(mWordType))
return;
mWordType = aType;
for (size_t i = 0; i < EventListeners.size(); i++) {
EventListeners[i]->changedWordType(this);
}
} | setWordType | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void __cdecl showHelp() {
__int64 v0;
__int64 v1;
__int64 v2;
__int64 v3;
__int64 v4;
__int64 v5;
__int64 v6;
__int64 v7;
__int64 v8;
__int64 v9;
__int64 v10;
__int64 v11;
__int64 v12;
__int64 v13;
__int64 v14;
v0 = std::operator < < <std::char_traits<char>>(&std::cout,
... | void showHelp() {
cout << "Usage: kasumi [option]" << endl;
cout << "Option:" << endl;
cout << " -h --help Show this message." << endl;
cout << " -v --version Show Kasumi's version and copyright" << endl;
;
cout << " information" << endl;
cout << " -m --manage Run Kasu... | showHelp | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void __cdecl showVersion() {
__int64 v0;
__int64 v1;
__int64 v2;
v0 = std::operator < < <std::char_traits<char>>(&std::cout, "Kasumi ");
v1 = std::operator < < <std::char_traits<char>>(v0, "2.5");
v2 = std::operator < < <std::char_traits<char>>(
v1, " - a personal dictionary ma... | void showVersion() {
cout << "Kasumi " << VERSION << " - a personal dictionary manager for Anthy"
<< endl;
cout << "Copyright (C) 2004-2006 Takashi Nakamoto.\n";
cout << "This program comes with NO WARRANTY, to the extent permitted "
"by law. \nYou may redistribute it under the terms of the GNU "... | showVersion | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
gint sortFuncByFreq(GtkTreeModel *model, GtkTreeIter *a, GtkTreeIter *b,
gpointer user_data) {
int Frequency;
unsigned int id_a;
unsigned int id_b;
KasumiWord *word_a;
KasumiWord *word_b;
unsigned long v11;
v11 = __readfsqword(0x28u);
gtk_tree_model_get(model, a, 0, &id_a, 0xFFFFFFF... | gint sortFuncByFreq(GtkTreeModel *model, GtkTreeIter *a, GtkTreeIter *b,
gpointer user_data) {
unsigned int id_a, id_b;
gtk_tree_model_get(model, a, COL_ID, &id_a, -1);
gtk_tree_model_get(model, b, COL_ID, &id_b, -1);
KasumiWord *word_a = KasumiWord::getWordFromID(id_a);
KasumiWord *word_b... | sortFuncByFreq | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
gint sortFuncBySound(GtkTreeModel *model, GtkTreeIter *iter_a,
GtkTreeIter *iter_b, gpointer user_data) {
int v4;
unsigned char first_b;
unsigned char second_b;
unsigned char third_b;
unsigned int id_a;
unsigned int id_b;
int i;
int size_a;
int size_b;
int size;
int a;
int b... | gint sortFuncBySound(GtkTreeModel *model, GtkTreeIter *iter_a,
GtkTreeIter *iter_b, gpointer user_data) {
unsigned int id_a, id_b;
gtk_tree_model_get(model, iter_a, COL_ID, &id_a, -1);
gtk_tree_model_get(model, iter_b, COL_ID, &id_b, -1);
KasumiWord *word_a = KasumiWord::getWordFromID(id_a)... | sortFuncBySound | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
gint sortFuncByWordClass(GtkTreeModel *model, GtkTreeIter *iter_a,
GtkTreeIter *iter_b, gpointer user_data) {
KasumiWordType *WordType;
KasumiWordType *v5;
unsigned int id_a;
unsigned int id_b;
KasumiWord *word_a;
KasumiWord *word_b;
unsigned long v12;
v12 = __readfsqword(0x28u... | gint sortFuncByWordClass(GtkTreeModel *model, GtkTreeIter *iter_a,
GtkTreeIter *iter_b, gpointer user_data) {
unsigned int id_a, id_b;
gtk_tree_model_get(model, iter_a, COL_ID, &id_a, -1);
gtk_tree_model_get(model, iter_b, COL_ID, &id_b, -1);
KasumiWord *word_a = KasumiWord::getWordFrom... | sortFuncByWordClass | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void __cdecl KasumiMainWindow::startedEditingTextColumn(
KasumiMainWindow *const this, GtkCellEditable *editable,
std::string *p_path, TextColumn col) {
__int64 v4;
__int64 v5;
v4 = std::string::c_str(p_path);
this->editingPath = (GtkTreePath *)gtk_tree_path_new_from_string(v4);
v5 = g_type_check_ins... | void KasumiMainWindow::startedEditingTextColumn(GtkCellEditable *editable,
string path, TextColumn col) {
editingPath = gtk_tree_path_new_from_string(path.c_str());
g_signal_connect(G_OBJECT(editable), "key-press-event",
G_CALLBACK(_call_back_key_p... | startedEditingTextColumn | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
int __cdecl str2int(const std::string *str) {
std::_Ios_Openmode v1;
int v2;
int i;
_BYTE v5[392];
unsigned __int64 v6;
v6 = __readfsqword(0x28u);
if (!isInt(str))
return 0;
v1 = std::operator | (std::_Ios_Openmode::_S_out, std::_Ios_Openmode::_S_in);
std::basic_stringstream<char, std::char_trait... | int str2int(const string &str) {
if (isInt(str)) {
stringstream ss(str);
int i;
ss >> i;
return i;
}
return 0;
} | str2int | kasumi-2.5-r1 | app-dicts | O0/app-dicts/kasumi-2.5-r1/kasumi | ida | O0 |
void AddLZ77Block(const ZopfliOptions *options, int btype, int final,
const ZopfliLZ77Store *lz77, size_t lstart, size_t lend,
size_t expected_data_size, unsigned char *bp_0,
unsigned char **out, size_t *outsize) {
size_t v10;
int v11;
unsigned int detect_tree... | static void AddLZ77Block(const ZopfliOptions *options, int btype, int final,
const ZopfliLZ77Store *lz77, size_t lstart,
size_t lend, size_t expected_data_size,
unsigned char *bp, unsigned char **out,
size_t *outsize) {
... | AddLZ77Block | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void AddLZ77Data(const ZopfliLZ77Store *lz77, size_t lstart, size_t lend,
size_t expected_data_size, const unsigned int *ll_symbols,
const unsigned int *ll_lengths, const unsigned int *d_symbols,
const unsigned int *d_lengths, unsigned char *bp_0,
unsi... | static void AddLZ77Data(const ZopfliLZ77Store *lz77, size_t lstart, size_t lend,
size_t expected_data_size, const unsigned *ll_symbols,
const unsigned *ll_lengths, const unsigned *d_symbols,
const unsigned *d_lengths, unsigned char *bp,
... | AddLZ77Data | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
size_t CalculateBlockSymbolSizeSmall(const unsigned int *ll_lengths,
const unsigned int *d_lengths,
const ZopfliLZ77Store *lz77, size_t lstart,
size_t lend) {
int ll_symbol;
int d_symbol;
size_t result;
... | static size_t CalculateBlockSymbolSizeSmall(const unsigned *ll_lengths,
const unsigned *d_lengths,
const ZopfliLZ77Store *lz77,
size_t lstart, size_t lend) {
size_t result = 0;
size_t ... | CalculateBlockSymbolSizeSmall | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void FollowPath(ZopfliBlockState *s, const unsigned char *in, size_t instart,
size_t inend, unsigned short *path, size_t pathsize,
ZopfliLZ77Store *store, ZopfliHash *h) {
size_t v8;
unsigned short dummy_length;
unsigned short dist;
unsigned short length;
size_t i;
size_t j;
... | static void FollowPath(ZopfliBlockState *s, const unsigned char *in,
size_t instart, size_t inend, unsigned short *path,
size_t pathsize, ZopfliLZ77Store *store, ZopfliHash *h) {
size_t i, j, pos = 0;
size_t windowstart =
instart > ZOPFLI_WINDOW_SIZE ? instart - Z... | FollowPath | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
double GetBestLengths(ZopfliBlockState *s, const unsigned char *in,
size_t instart, size_t inend, CostModelFun *costmodel,
void *costcontext, unsigned short *length_array,
ZopfliHash *h, float *costs) {
size_t v9;
float v11;
double v12;
float v13... | static double GetBestLengths(ZopfliBlockState *s, const unsigned char *in,
size_t instart, size_t inend,
CostModelFun *costmodel, void *costcontext,
unsigned short *length_array, ZopfliHash *h,
float *cos... | GetBestLengths | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
double GetCostFixed(unsigned int litlen, unsigned int dist, void *unused) {
int cost;
int dbits;
int lbits;
if (dist) {
dbits = ZopfliGetDistExtraBits(dist);
lbits = ZopfliGetLengthExtraBits(litlen);
if (ZopfliGetLengthSymbol(litlen) > 279)
cost = 8;
else
cost = 7;
return (doubl... | static double GetCostFixed(unsigned litlen, unsigned dist, void *unused) {
(void)unused;
if (dist == 0) {
if (litlen <= 143)
return 8;
else
return 9;
} else {
int dbits = ZopfliGetDistExtraBits(dist);
int lbits = ZopfliGetLengthExtraBits(litlen);
int lsym = ZopfliGetLengthSymbol(li... | GetCostFixed | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
double GetCostStat(unsigned int litlen, unsigned int dist, void *context) {
int lsym;
int lbits;
int dsym;
if (!dist)
return *((double *)context + litlen + 320);
lsym = ZopfliGetLengthSymbol(litlen);
lbits = ZopfliGetLengthExtraBits(litlen);
dsym = ZopfliGetDistSymbol(dist);
return *((double *)cont... | static double GetCostStat(unsigned litlen, unsigned dist, void *context) {
SymbolStats *stats = (SymbolStats *)context;
if (dist == 0) {
return stats->ll_symbols[litlen];
} else {
int lsym = ZopfliGetLengthSymbol(litlen);
int lbits = ZopfliGetLengthExtraBits(litlen);
int dsym = ZopfliGetDistSymbol... | GetCostStat | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
const unsigned char *GetMatch(const unsigned char *scan,
const unsigned char *match,
const unsigned char *end,
const unsigned char *safe_end) {
while (scan < safe_end && *(_QWORD *)scan == *(_QWORD *)match) {
scan += 8;
... | static const unsigned char *GetMatch(const unsigned char *scan,
const unsigned char *match,
const unsigned char *end,
const unsigned char *safe_end) {
if (sizeof(size_t) == 8) {
while (scan < safe_end ... | GetMatch | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void GetStatistics(const ZopfliLZ77Store *store, SymbolStats *stats) {
int LengthSymbol;
int DistSymbol;
size_t i;
for (i = 0; i < store->size; ++i) {
if (store->dists[i]) {
LengthSymbol = ZopfliGetLengthSymbol(store->litlens[i]);
++stats->litlens[LengthSymbol];
DistSymbol = ZopfliGetDist... | static void GetStatistics(const ZopfliLZ77Store *store, SymbolStats *stats) {
size_t i;
for (i = 0; i < store->size; i++) {
if (store->dists[i] == 0) {
stats->litlens[store->litlens[i]]++;
} else {
stats->litlens[ZopfliGetLengthSymbol(store->litlens[i])]++;
stats->dists[ZopfliGetDistSymbol... | GetStatistics | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
double LZ77OptimalRun(ZopfliBlockState *s, const unsigned char *in,
size_t instart, size_t inend, unsigned short **path,
size_t *pathsize, unsigned short *length_array,
CostModelFun *costmodel, void *costcontext,
ZopfliLZ77Store *st... | static double LZ77OptimalRun(ZopfliBlockState *s, const unsigned char *in,
size_t instart, size_t inend,
unsigned short **path, size_t *pathsize,
unsigned short *length_array,
CostModelFun *costmodel, voi... | LZ77OptimalRun | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void OptimizeHuffmanForRle(unsigned int length, size_t *counts) {
unsigned int i;
unsigned int ia;
unsigned int ib;
int k;
int ka;
int stride;
int stridea;
int count;
size_t symbol;
size_t sum;
size_t limit;
int *good_for_rle;
while (length && !counts[length - 1])
--length;
if (length) ... | void OptimizeHuffmanForRle(unsigned length, size_t *counts) {
unsigned i;
int k, stride;
size_t symbol, sum, limit;
int *good_for_rle;
for (; length > 0; --length) {
if (counts[length - 1] != 0) {
break;
}
}
if (length == 0) {
return;
}
good_for_rle = (int *)malloc(length * sizeof... | OptimizeHuffmanForRle | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void PrintBlockSplitPoints(const ZopfliLZ77Store *lz77,
const size_t *lz77splitpoints, size_t nlz77points) {
long v3;
size_t *v4;
size_t *splitpoints;
size_t npoints;
size_t i;
size_t ia;
size_t ib;
size_t pos;
size_t length;
splitpoints = 0;
npoints = 0;
pos = 0;
i... | static void PrintBlockSplitPoints(const ZopfliLZ77Store *lz77,
const size_t *lz77splitpoints,
size_t nlz77points) {
size_t *splitpoints = 0;
size_t npoints = 0;
size_t i;
size_t pos = 0;
if (nlz77points > 0) {
for (i = 0; i < lz77->size;... | PrintBlockSplitPoints | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void StoreInLongestMatchCache(ZopfliBlockState *s, size_t pos, size_t limit,
const unsigned short *sublen,
unsigned short distance, unsigned short length) {
bool v6;
unsigned short v8;
size_t lmcpos;
lmcpos = pos - s->blockstart;
v6 = s->lmc && (!s-... | static void StoreInLongestMatchCache(ZopfliBlockState *s, size_t pos,
size_t limit, const unsigned short *sublen,
unsigned short distance,
unsigned short length) {
size_t lmcpos = pos - s->blockstart;
un... | StoreInLongestMatchCache | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void TraceBackwards(size_t size, const unsigned short *length_array,
unsigned short **path, size_t *pathsize) {
unsigned short *v4;
unsigned short temp;
unsigned long index;
size_t indexa;
index = size;
if (size) {
do {
if ((*pathsize & (*pathsize - 1)) == 0) {
if (*pa... | static void TraceBackwards(size_t size, const unsigned short *length_array,
unsigned short **path, size_t *pathsize) {
size_t index = size;
if (size == 0)
return;
for (;;) {
ZOPFLI_APPEND_DATA(length_array[index], path, pathsize);
assert(length_array[index] <= index);
as... | TraceBackwards | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int TryGetFromLongestMatchCache(ZopfliBlockState *s, size_t pos, size_t *limit,
unsigned short *sublen,
unsigned short *distance,
unsigned short *length) {
bool v6;
bool v7;
unsigned int v8;
unsigned char cache_avail... | static int TryGetFromLongestMatchCache(ZopfliBlockState *s, size_t pos,
size_t *limit, unsigned short *sublen,
unsigned short *distance,
unsigned short *length) {
size_t lmcpos = pos - s->blockstart;
... | TryGetFromLongestMatchCache | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
double TryOptimizeHuffmanForRle(const ZopfliLZ77Store *lz77, size_t lstart,
size_t lend, const size_t *ll_counts,
const size_t *d_counts,
unsigned int *ll_lengths,
unsigned int *d_lengths) {
... | static double TryOptimizeHuffmanForRle(const ZopfliLZ77Store *lz77,
size_t lstart, size_t lend,
const size_t *ll_counts,
const size_t *d_counts,
unsigned *ll_length... | TryOptimizeHuffmanForRle | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void ZopfliBlockSplit(const ZopfliOptions *options, const unsigned char *in,
size_t instart, size_t inend, size_t maxblocks,
size_t **splitpoints, size_t *npoints) {
size_t v7;
size_t *v8;
size_t *lz77splitpoints;
size_t nlz77points;
size_t pos;
size_t i;
Zopfli... | void ZopfliBlockSplit(const ZopfliOptions *options, const unsigned char *in,
size_t instart, size_t inend, size_t maxblocks,
size_t **splitpoints, size_t *npoints) {
size_t pos = 0;
size_t i;
ZopfliBlockState s;
size_t *lz77splitpoints = 0;
size_t nlz77points = 0;
... | ZopfliBlockSplit | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void ZopfliBlockSplitLZ77(const ZopfliOptions *options,
const ZopfliLZ77Store *lz77, size_t maxblocks,
size_t **splitpoints, size_t *npoints) {
size_t lstart;
size_t lend;
double splitcost;
size_t i;
size_t numblocks;
size_t llpos;
unsigned char *done;
... | void ZopfliBlockSplitLZ77(const ZopfliOptions *options,
const ZopfliLZ77Store *lz77, size_t maxblocks,
size_t **splitpoints, size_t *npoints) {
size_t lstart, lend;
size_t i;
size_t llpos = 0;
size_t numblocks = 1;
unsigned char *done;
double splitcost, or... | ZopfliBlockSplitLZ77 | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void ZopfliCalculateBitLengths(const size_t *count, size_t n, int maxbits,
unsigned int *bitlengths) {
if (ZopfliLengthLimitedCodeLengths(count, n, maxbits, bitlengths))
__assert_fail("!error", "zopfli/src/zopfli/tree.c", 0x64u,
"ZopfliCalculateBitLengths");
} | void ZopfliCalculateBitLengths(const size_t *count, size_t n, int maxbits,
unsigned *bitlengths) {
int error = ZopfliLengthLimitedCodeLengths(count, n, maxbits, bitlengths);
(void)error;
assert(!error);
} | ZopfliCalculateBitLengths | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void ZopfliCalculateEntropy(const size_t *count, size_t n, double *bitlengths) {
double v3;
double v4;
long v5;
long v6;
double v7;
size_t v8;
signed int sum;
unsigned int i;
unsigned int ia;
double log2sum;
sum = 0;
for (i = 0; n > i; ++i)
sum += count[i];
if (sum) {
v4 = log((double... | void ZopfliCalculateEntropy(const size_t *count, size_t n, double *bitlengths) {
static const double kInvLog2 = 1.4426950408889;
unsigned sum = 0;
unsigned i;
double log2sum;
for (i = 0; i < n; ++i) {
sum += count[i];
}
log2sum = (sum == 0 ? log(n) : log(sum)) * kInvLog2;
for (i = 0; i < n; ++i) {
... | ZopfliCalculateEntropy | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void ZopfliFindLongestMatch(ZopfliBlockState *s, const ZopfliHash *h,
const unsigned char *array, size_t pos, size_t size,
size_t limit, unsigned short *sublen,
unsigned short *distance, unsigned short *length) {
unsigned int v9;
un... | void ZopfliFindLongestMatch(ZopfliBlockState *s, const ZopfliHash *h,
const unsigned char *array, size_t pos, size_t size,
size_t limit, unsigned short *sublen,
unsigned short *distance, unsigned short *length) {
unsigned short hpos =... | ZopfliFindLongestMatch | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int ZopfliGetDistExtraBits(int dist) {
unsigned int v2;
if (dist <= 4)
return 0;
_BitScanReverse(&v2, dist - 1);
return v2 - 1;
} | int ZopfliGetDistExtraBits(int dist) {
#ifdef ZOPFLI_HAS_BUILTIN_CLZ
if (dist < 5)
return 0;
return (31 ^ __builtin_clz(dist - 1)) - 1;
#else
if (dist < 5)
return 0;
else if (dist < 9)
return 1;
else if (dist < 17)
return 2;
else if (dist < 33)
return 3;
else if (dist < 65)
return ... | ZopfliGetDistExtraBits | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int ZopfliGetDistExtraBitsValue(int dist) {
unsigned int v2;
if (dist <= 4)
return 0;
_BitScanReverse(&v2, dist - 1);
return (dist - ((1 << v2) + 1)) & ((1 << (v2 - 1)) - 1);
} | int ZopfliGetDistExtraBitsValue(int dist) {
#ifdef ZOPFLI_HAS_BUILTIN_CLZ
if (dist < 5) {
return 0;
} else {
int l = 31 ^ __builtin_clz(dist - 1);
return (dist - (1 + (1 << l))) & ((1 << (l - 1)) - 1);
}
#else
if (dist < 5)
return 0;
else if (dist < 9)
return (dist - 5) & 1;
else if (dis... | ZopfliGetDistExtraBitsValue | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int ZopfliGetDistSymbol(int dist) {
unsigned int v2;
if (dist <= 4)
return dist - 1;
_BitScanReverse(&v2, dist - 1);
return 2 * v2 + (((dist - 1) >> (v2 - 1)) & 1);
} | int ZopfliGetDistSymbol(int dist) {
#ifdef ZOPFLI_HAS_BUILTIN_CLZ
if (dist < 5) {
return dist - 1;
} else {
int l = (31 ^ __builtin_clz(dist - 1));
int r = ((dist - 1) >> (l - 1)) & 1;
return l * 2 + r;
}
#else
if (dist < 193) {
if (dist < 13) {
if (dist < 5)
return dist - 1;
... | ZopfliGetDistSymbol | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int ZopfliGetDistSymbolExtraBits(int s) { return table_0[s]; } | int ZopfliGetDistSymbolExtraBits(int s) {
static const int table[30] = {0, 0, 0, 0, 1, 1, 2, 2, 3, 3,
4, 4, 5, 5, 6, 6, 7, 7, 8, 8,
9, 9, 10, 10, 11, 11, 12, 12, 13, 13};
return table[s];
} | ZopfliGetDistSymbolExtraBits | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int ZopfliGetLengthExtraBits(int l) { return table_4[l]; } | int ZopfliGetLengthExtraBits(int l) {
static const int table[259] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4,
4, 4, 4,... | ZopfliGetLengthExtraBits | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int ZopfliGetLengthExtraBitsValue(int l) { return table_3[l]; } | int ZopfliGetLengthExtraBitsValue(int l) {
static const int table[259] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0,
1, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0,
1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2,
3, 4,... | ZopfliGetLengthExtraBitsValue | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int ZopfliGetLengthSymbol(int l) { return table_2[l]; } | int ZopfliGetLengthSymbol(int l) {
static const int table[259] = {
0, 0, 0, 257, 258, 259, 260, 261, 262, 263, 264, 265, 265, 266, 266,
267, 267, 268, 268, 269, 269, 269, 269, 270, 270, 270, 270, 271, 271, 271,
271, 272, 272, 272, 272, 273, 273, 273, 273, 273, 273, 273, 273, 274, 274,
27... | ZopfliGetLengthSymbol | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int ZopfliGetLengthSymbolExtraBits(int s) { return table_1[s - 257]; } | int ZopfliGetLengthSymbolExtraBits(int s) {
static const int table[29] = {0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2,
2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0};
return table[s - 257];
} | ZopfliGetLengthSymbolExtraBits | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void ZopfliInitCache(size_t blocksize, ZopfliLongestMatchCache *lmc) {
size_t i;
size_t ia;
size_t ib;
lmc->length = (unsigned short *)malloc(2 * blocksize);
lmc->dist = (unsigned short *)malloc(2 * blocksize);
lmc->sublen = (unsigned char *)malloc(24 * blocksize);
if (!lmc->sublen) {
fprintf(stderr,... | void ZopfliInitCache(size_t blocksize, ZopfliLongestMatchCache *lmc) {
size_t i;
lmc->length = (unsigned short *)malloc(sizeof(unsigned short) * blocksize);
lmc->dist = (unsigned short *)malloc(sizeof(unsigned short) * blocksize);
lmc->sublen = (unsigned char *)malloc(ZOPFLI_CACHE_LENGTH * 3 * blocksize);
if... | ZopfliInitCache | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void ZopfliLZ77Greedy(ZopfliBlockState *s, const unsigned char *in,
size_t instart, size_t inend, ZopfliLZ77Store *store,
ZopfliHash *h) {
size_t v6;
unsigned short leng;
unsigned short dist;
unsigned int prev_length;
unsigned int prev_match;
int match_available;
... | void ZopfliLZ77Greedy(ZopfliBlockState *s, const unsigned char *in,
size_t instart, size_t inend, ZopfliLZ77Store *store,
ZopfliHash *h) {
size_t i = 0, j;
unsigned short leng;
unsigned short dist;
int lengthscore;
size_t windowstart =
instart > ZOPFLI_WINDOW_... | ZopfliLZ77Greedy | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void ZopfliLengthsToSymbols(const unsigned int *lengths, size_t n,
unsigned int maxbits, unsigned int *symbols) {
size_t *v4;
unsigned int bits;
unsigned int bitsa;
unsigned int i;
unsigned int ia;
unsigned int ib;
unsigned int code;
unsigned int len;
size_t *bl_count;
si... | void ZopfliLengthsToSymbols(const unsigned *lengths, size_t n, unsigned maxbits,
unsigned *symbols) {
size_t *bl_count = (size_t *)malloc(sizeof(size_t) * (maxbits + 1));
size_t *next_code = (size_t *)malloc(sizeof(size_t) * (maxbits + 1));
unsigned bits, i;
unsigned code;
for (i ... | ZopfliLengthsToSymbols | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void ZopfliStoreLitLenDist(unsigned short length, unsigned short dist,
size_t pos, ZopfliLZ77Store *store) {
size_t *v4;
size_t v5;
size_t *v6;
size_t v7;
unsigned short *v8;
unsigned short *v9;
size_t *v10;
unsigned short *v11;
unsigned short *v12;
size_t *v13;
unsigned... | void ZopfliStoreLitLenDist(unsigned short length, unsigned short dist,
size_t pos, ZopfliLZ77Store *store) {
size_t i;
size_t origsize = store->size;
size_t llstart = ZOPFLI_NUM_LL * (origsize / ZOPFLI_NUM_LL);
size_t dstart = ZOPFLI_NUM_D * (origsize / ZOPFLI_NUM_D);
if (origsize... | ZopfliStoreLitLenDist | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void ZopfliSublenToCache(const unsigned short *sublen, size_t pos,
size_t length, ZopfliLongestMatchCache *lmc) {
unsigned int bestlength;
size_t i;
size_t j;
unsigned char *cache;
j = 0;
bestlength = 0;
cache = &lmc->sublen[24 * pos];
if (length > 2) {
for (i = 3; i <= len... | void ZopfliSublenToCache(const unsigned short *sublen, size_t pos,
size_t length, ZopfliLongestMatchCache *lmc) {
size_t i;
size_t j = 0;
unsigned bestlength = 0;
unsigned char *cache;
#if ZOPFLI_CACHE_LENGTH == 0
return;
#endif
cache = &lmc->sublen[ZOPFLI_CACHE_LENGTH * pos * 3];... | ZopfliSublenToCache | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void ZopfliVerifyLenDist(const unsigned char *data, size_t datasize, size_t pos,
unsigned short dist, unsigned short length) {
size_t i;
if (datasize < length + pos)
__assert_fail("pos + length <= datasize", "zopfli/src/zopfli/lz77.c",
0x117u, "ZopfliVerifyLenDist");
... | void ZopfliVerifyLenDist(const unsigned char *data, size_t datasize, size_t pos,
unsigned short dist, unsigned short length) {
size_t i;
assert(pos + length <= datasize);
for (i = 0; i < length; i++) {
if (data[pos - dist + i] != data[pos + i]) {
assert(data[pos - dist + i] ==... | ZopfliVerifyLenDist | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
unsigned long adler32_comb(unsigned long adler1, unsigned long adler2,
size_t len2) {
unsigned long sum1;
unsigned long sum2;
sum1 = (unsigned short)adler2 + (unsigned long)(unsigned short)adler1 + 65520;
sum2 = WORD1(adler1) + (unsigned long)WORD1(adler2) - len2 % 0xFFF1 +
... | local unsigned long adler32_comb(unsigned long adler1, unsigned long adler2,
size_t len2) {
unsigned long sum1;
unsigned long sum2;
unsigned rem;
rem = (unsigned)(len2 % BASE);
sum1 = adler1 & LOW16;
sum2 = (rem * sum1) % BASE;
sum1 += (adler2 & LOW16) + BASE - 1;
sum2 ... | adler32_comb | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
unsigned long adler32z(unsigned long adler, const unsigned char *buf,
size_t len) {
while (len > 0xFFFFFFFF && buf) {
adler = adler32(adler, buf, 0xFFFFFFFFLL);
buf += 0xFFFFFFFFLL;
len -= 0xFFFFFFFFLL;
}
return adler32(adler, buf, (unsigned int)len);
} | local unsigned long adler32z(unsigned long adler, unsigned char const *buf,
size_t len) {
while (len > UINT_MAX && buf != NULL) {
adler = adler32(adler, buf, UINT_MAX);
buf += UINT_MAX;
len -= UINT_MAX;
}
return adler32(adler, buf, (unsigned)len);
} | adler32z | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void *alloc(void *ptr, size_t size) {
void *ptra;
ptra = realloc(ptr, size);
if (!ptra)
try_throw_(12, "not enough memory", 0);
return ptra;
} | local void *alloc(void *ptr, size_t size) {
ptr = REALLOC(ptr, size);
if (ptr == NULL)
throw(ENOMEM, "not enough memory");
return ptr;
} | alloc | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void append_len(job *job, size_t len) {
unsigned char *v2;
size_t v3;
unsigned char *v4;
size_t v5;
unsigned char *v6;
size_t v7;
unsigned char *v8;
size_t v9;
unsigned char *v10;
size_t v11;
unsigned char *v12;
size_t v13;
unsigned char *buf;
size_t v15;
unsigned char *v16;
size_t v17;
... | local void append_len(struct job *job, size_t len) {
struct space *lens;
assert(len < 539000896UL);
if (job->lens == NULL)
job->lens = get_space(&lens_pool);
lens = job->lens;
if (lens->size < lens->len + 3)
grow_space(lens);
if (len < 64)
lens->buf[lens->len++] = (unsigned char)(len + 128);
... | append_len | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void cat() {
unsigned char buf[1];
unsigned long v1;
v1 = __readfsqword(0x28u);
if (g.magic1 != -1) {
buf[0] = g.magic1;
g.out_tot += writen(g.outd, buf, 1u);
}
while (g.in_left) {
g.out_tot += writen(g.outd, g.in_next, g.in_left);
g.in_left = 0;
load();
}
} | local void cat(void) {
if (g.magic1 != -1) {
unsigned char buf[1] = {g.magic1};
g.out_tot += writen(g.outd, buf, 1);
}
while (g.in_left) {
g.out_tot += writen(g.outd, g.in_next, g.in_left);
g.in_left = 0;
load();
}
} | cat | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int complain(char *fmt, ...) {
long v1;
long v2;
long v3;
long v4;
long v5;
va_list ap;
unsigned long v8;
long v9;
long v10;
long v11;
long v12;
long v13;
va_start(ap, fmt);
v3 = va_arg(ap, _QWORD);
v1 = va_arg(ap, _QWORD);
v2 = va_arg(ap, _QWORD);
v4 = va_arg(ap, _QWORD);
v5 = va_a... | local int complain(char *fmt, ...) {
g.ret = 1;
va_list ap;
va_start(ap, fmt);
message(fmt, ap);
va_end(ap);
return 0;
} | complain | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void compress_thread(void *dummy) {
size_t v1;
space *space;
unsigned char *buf;
unsigned char *v4;
size_t v5;
unsigned char *v6;
unsigned char *v7;
unsigned char *v8;
long v9;
unsigned char *v10;
unsigned char *v11;
_BOOL4 v12;
unsigned char *v13;
space *v14;
size_t v15;
unsigned char *... | local void compress_thread(void *dummy) {
struct job *job;
struct job *here, **prior;
unsigned long check;
unsigned char *next;
size_t left;
size_t len;
#if ZLIB_VERNUM >= 0x1260
int bits;
#endif
int ret;
ball_t err;
(void)dummy;
try {
z_stream strm;
#ifndef NOZOPFLI
struct space *temp =... | compress_thread | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
size_t compressed_suffix(char *nm) {
const char *nma;
char *nmb;
size_t len;
nma = nm;
len = strlen(nm);
if (len > 4) {
nma = &nm[len - 4];
len = 4;
if (!strcmp(nma, ".zip") || !strcmp(nma, ".ZIP") || !strcmp(nma, ".tgz"))
return 4;
}
if (len > 3) {
nma += len - 3;
len = 3;
... | local size_t compressed_suffix(char *nm) {
size_t len;
len = strlen(nm);
if (len > 4) {
nm += len - 4;
len = 4;
if (strcmp(nm, ".zip") == 0 || strcmp(nm, ".ZIP") == 0 ||
strcmp(nm, ".tgz") == 0)
return 4;
}
if (len > 3) {
nm += len - 3;
len = 3;
if (strcmp(nm, ".gz") == ... | compressed_suffix | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int copymeta(char *from, char *to) {
int ret;
int reta;
timeval times[2];
stat st;
unsigned long v7;
v7 = __readfsqword(0x28u);
if (stat64(from, (struct stat64 *)&st) || (st.st_mode & 0xF000) != 0x8000)
return -4;
ret = chmod(to, st.st_mode & 0xFFF);
reta = chown(to, st.st_uid, st.st_gid) + ret;
... | local int copymeta(char *from, char *to) {
struct stat st;
struct timeval times[2];
if (stat(from, &st) != 0 || (st.st_mode & S_IFMT) != S_IFREG)
return -4;
int ret = chmod(to, st.st_mode & 07777);
ret += chown(to, st.st_uid, st.st_gid);
times[0].tv_sec = st.st_atime;
times[0].tv_usec = 0;
times... | copymeta | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
unsigned long crc32_comb(unsigned long crc1, unsigned long crc2, size_t len2) {
crc_t shift;
if (len2 == g.block)
shift = g.shift;
else
shift = x2nmodp(len2, 3u);
return crc2 ^ multmodp(shift, crc1);
} | local unsigned long crc32_comb(unsigned long crc1, unsigned long crc2,
size_t len2) {
return multmodp(len2 == g.block ? g.shift : x2nmodp(len2, 3), crc1) ^ crc2;
} | crc32_comb | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
unsigned long crc32z(unsigned long crc, const unsigned char *buf, size_t len) {
while (len > 0xFFFFFFFF && buf) {
crc = crc32(crc, buf, 0xFFFFFFFFLL);
buf += 0xFFFFFFFFLL;
len -= 0xFFFFFFFFLL;
}
return crc32(crc, buf, (unsigned int)len);
} | local unsigned long crc32z(unsigned long crc, unsigned char const *buf,
size_t len) {
while (len > UINT_MAX && buf != NULL) {
crc = crc32(crc, buf, UINT_MAX);
buf += UINT_MAX;
len -= UINT_MAX;
}
return crc32(crc, buf, (unsigned)len);
} | crc32z | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void cut_short(int sig) {
int v1;
if (g.outd != -1 && g.outd != 1) {
unlink(g.outf);
if (g.outf) {
free(g.outf);
g.outf = 0;
}
g.outd = -1;
}
if (sig >= 0)
v1 = 4;
else
v1 = -sig;
_exit(v1);
} | while (0)
#else
#define log_dump()
#define Trace(x)
#endif
local void cut_short(int sig) {
if (sig == SIGINT) {
Trace(("termination by user"));
}
if (g.outd != -1 && g.outd != 1) {
unlink(g.outf);
RELEASE(g.outf);
g.outd = -1;
}
log_dump();
_exit(sig < 0 ? -sig : EI... | cut_short | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void cut_yarn(int err) { try_throw_(err, "internal threads error", 0); } | local void cut_yarn(int err) { throw(err, "internal threads error"); } | cut_yarn | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void defaults() {
g.level = -1;
g.strategy = 0;
ZopfliInitOptions(&g.zopts);
g.block = 0x20000;
g.procs = nprocs(8);
g.shift = x2nmodp(g.block, 3u);
g.rsync = 0;
g.setdict = 1;
g.verbosity = 1;
g.headis = 3;
g.pipeout = 0;
g.sufx = ".gz";
g.comment = 0;
g.decode = 0;
g.list = 0;
g.keep =... | local void defaults(void) {
g.level = Z_DEFAULT_COMPRESSION;
g.strategy = Z_DEFAULT_STRATEGY;
#ifndef NOZOPFLI
ZopfliInitOptions(&g.zopts);
#endif
g.block = 131072UL;
#ifdef NOTHREAD
g.procs = 1;
#else
g.procs = nprocs(8);
g.shift = x2nmodp(g.block, 3);
#endif
g.rsync = 0;
g.setdict = 1;
g.verbosit... | defaults | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void deflate_engine(z_stream *strm, space *out, int flush) {
uInt v3;
size_t room;
do {
room = out->size - out->len;
if (!room) {
grow_space(out);
room = out->size - out->len;
}
strm->next_out = &out->buf[out->len];
if (room > 0xFFFFFFFE)
v3 = -1;
else
v3 = room;
... | local void deflate_engine(z_stream *strm, struct space *out, int flush) {
size_t room;
do {
room = out->size - out->len;
if (room == 0) {
grow_space(out);
room = out->size - out->len;
}
strm->next_out = out->buf + out->len;
strm->avail_out = room < UINT_MAX ? (unsigned)room : UINT_M... | deflate_engine | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
time_t dos2time(unsigned long dos) {
tm_0 tm;
unsigned long v3;
v3 = __readfsqword(0x28u);
if (!dos)
return time(0);
tm.tm_year = ((dos >> 25) & 0x7F) + 80;
tm.tm_mon = ((dos >> 21) & 0xF) - 1;
tm.tm_mday = (dos >> 16) & 0x1F;
tm.tm_hour = (dos >> 11) & 0x1F;
tm.tm_min = (dos >> 5) & 0x3F;
tm.t... | while (0)
#define PULL2L(p) ((p)[0] + ((unsigned)((p)[1]) << 8))
#define PULL4L(p) (PULL2L(p) + ((unsigned long)(PULL2L((p) + 2)) << 16))
#define PULL2M(p) (((unsigned)((p)[0]) << 8) + (p)[1])
#define PULL4M(p) (((unsigned long)(PULL2M(p)) << 16) + PULL2M((p) + 2))
local time_t dos2time(unsigned long dos) {
str... | dos2time | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void drop_space(space *space) {
long use;
pool *pool;
if (space) {
possess_(space->use, "pigz.c", 1532);
use = peek_lock(space->use);
if (!use)
__assert_fail("use != 0", "pigz.c", 0x5FEu, "drop_space");
twist_(space->use, twist_op_BY, -1, "pigz.c", 1535);
if (use == 1) {
pool = sp... | local void drop_space(struct space *space) {
long use;
struct pool *pool;
if (space == NULL)
return;
possess(space->use);
use = peek_lock(space->use);
assert(use != 0);
twist(space->use, BY, -1);
if (use == 1) {
pool = space->pool;
possess(pool->have);
space->next = pool->head;
pool... | drop_space | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void fail(int err, const char *file, long line, const char *func) {
fprintf(stderr, "%s: ", yarn_prefix);
switch (err) {
case 1:
fwrite("already unlocked", 1u, 0x10u, stderr);
break;
case 3:
fwrite("no such thread", 1u, 0xEu, stderr);
break;
case 11:
fwrite("resource unavailable", 1u, 0x14... | local void fail(int err, char const *file, long line, char const *func) {
fprintf(stderr, "%s: ", yarn_prefix);
switch (err) {
case EPERM:
fputs("already unlocked", stderr);
break;
case ESRCH:
fputs("no such thread", stderr);
break;
case EDEADLK:
fputs("resource deadlock", stderr);
bre... | fail | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void finish_jobs() {
job job;
unsigned long v1;
v1 = __readfsqword(0x28u);
if (compress_have) {
possess_(compress_have, "pigz.c", 1635);
job.seq = -1;
job.next = 0;
compress_head = &job;
compress_tail = &job.next;
twist_(compress_have, twist_op_BY, 1, "pigz.c", 1640);
if (join_all_(... | local void finish_jobs(void) {
struct job job;
int caught;
if (compress_have == NULL)
return;
possess(compress_have);
job.seq = -1;
job.next = NULL;
compress_head = &job;
compress_tail = &(job.next);
twist(compress_have, BY, +1);
caught = join_all();
Trace(("-- joined %d compress threads", ... | finish_jobs | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void free_lock_(lock *bolt, const char *file, long line) {
int ret;
int reta;
if (bolt) {
ret = pthread_cond_destroy(&bolt->cond);
if (ret)
fail(ret, file, line, "cond_destroy");
reta = pthread_mutex_destroy(&bolt->mutex);
if (reta)
fail(reta, file, line, "mutex_destroy");
my_free... | void free_lock_(lock *bolt, char const *file, long line) {
if (bolt == NULL)
return;
int ret = pthread_cond_destroy(&(bolt->cond));
if (ret)
fail(ret, file, line, "cond_destroy");
ret = pthread_mutex_destroy(&(bolt->mutex));
if (ret)
fail(ret, file, line, "mutex_destroy");
my_free(bolt);
} | free_lock_ | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int free_pool(pool *pool) {
int count;
space *space;
possess_(pool->have, "pigz.c", 1551);
for (count = 0;; ++count) {
space = pool->head;
if (!space)
break;
pool->head = space->next;
free(space->buf);
free_lock_(space->use, "pigz.c", 1556);
free(space);
}
if (count != pool->m... | local int free_pool(struct pool *pool) {
int count;
struct space *space;
possess(pool->have);
count = 0;
while ((space = pool->head) != NULL) {
pool->head = space->next;
FREE(space->buf);
free_lock(space->use);
FREE(space);
count++;
}
assert(count == pool->made);
release(pool->have)... | free_pool | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int get_header(int save) {
unsigned char *v1;
int v2;
unsigned char *v4;
int v5;
unsigned char *v6;
unsigned int v7;
unsigned char *v8;
int v9;
unsigned char *v10;
unsigned int v11;
unsigned char *v12;
int v13;
unsigned char *v14;
unsigned int v15;
unsigned char *in_next;
unsigned char *... | local int get_header(int save) {
unsigned magic;
unsigned method;
unsigned flags;
unsigned fname, extra;
unsigned tmp2;
unsigned long tmp4;
unsigned long crc;
if (save) {
g.stamp = 0;
RELEASE(g.hname);
RELEASE(g.hcomm);
}
g.magic1 = GET();
if (g.in_eof) {
g.magic1 = -1;
retur... | get_header | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
space *get_space(pool *pool) {
space *space;
space *spacea;
possess_(pool->have, "pigz.c", 1470);
if (!pool->limit)
wait_for_(pool->have, wait_op_NOT_TO_BE, 0, "pigz.c", 1472);
if (pool->head) {
space = pool->head;
pool->head = space->next;
twist_(pool->have, twist_op_BY, -1, "pigz.c", 1478);... | local struct space *get_space(struct pool *pool) {
struct space *space;
possess(pool->have);
if (pool->limit == 0)
wait_for(pool->have, NOT_TO_BE, 0);
if (pool->head != NULL) {
space = pool->head;
pool->head = space->next;
twist(pool->have, BY, -1);
possess(space->use);
twist(space->us... | get_space | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
size_t grow(size_t size) {
unsigned long sizea;
char shift;
size_t top;
sizea = (size >> 2) + size;
top = sizea;
shift = 0;
while (top > 7) {
top >>= 1;
++shift;
}
if (top == 7)
sizea = 1LL << (shift + 3);
if (sizea <= 0xF)
sizea = 16;
if (sizea <= size)
return -1;
return si... | while (0)
local inline size_t grow(size_t size) {
size_t was, top;
int shift;
was = size;
size += size >> 2;
top = size;
for (shift = 0; top > 7; shift++)
top >>= 1;
if (top == 7)
size = (size_t)1 << (shift + 3);
if (size < 16)
size = 16;
if (size <= was)
... | grow | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void grow_space(space *space) {
size_t more;
more = grow(space->size);
if (more == space->size)
try_throw_(34, "overflow", 0);
space->buf = (unsigned char *)alloc(space->buf, more);
space->size = more;
} | local void grow_space(struct space *space) {
size_t more;
more = grow(space->size);
if (more == space->size)
throw(ERANGE, "overflow");
space->buf = alloc(space->buf, more);
space->size = more;
} | grow_space | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int grumble(char *fmt, ...) {
long v1;
long v2;
long v3;
long v4;
long v5;
va_list ap;
unsigned long v8;
long v9;
long v10;
long v11;
long v12;
long v13;
va_start(ap, fmt);
v3 = va_arg(ap, _QWORD);
v1 = va_arg(ap, _QWORD);
v2 = va_arg(ap, _QWORD);
v4 = va_arg(ap, _QWORD);
v5 = va_ar... | local int grumble(char *fmt, ...) {
va_list ap;
va_start(ap, fmt);
message(fmt, ap);
va_end(ap);
return 0;
} | grumble | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void help() {
int n;
if (g.verbosity) {
for (n = 0; n <= 41; ++n)
fprintf(stderr, "%s\n", helptext[n]);
fflush(stderr);
exit(0);
}
} | local void help(void) {
int n;
if (g.verbosity == 0)
return;
for (n = 0; n < (int)(sizeof(helptext) / sizeof(char *)); n++)
fprintf(stderr, "%s\n", helptext[n]);
fflush(stderr);
exit(0);
} | help | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void *ignition(void *arg) {
__pthread_unwind_buf_t __cancel_buf;
unsigned long v3;
v3 = __readfsqword(0x28u);
if (__sigsetjmp((struct __jmp_buf_tag *)&__cancel_buf, 0)) {
((void (*)(void *))reenter)(arg);
__pthread_unwind_next(&__cancel_buf);
}
__pthread_register_cancel(&__cancel_buf);
(*(void (*... | local void *ignition(void *arg) {
struct capsule *capsule = arg;
pthread_cleanup_push(reenter, arg);
capsule->probe(capsule->payload);
pthread_cleanup_pop(1);
return NULL;
} | ignition | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void in_init() {
g.in_left = 0;
g.in_eof = 0;
g.in_short = 0;
g.in_tot = 0;
g.in_which = -1;
} | local void in_init(void) {
g.in_left = 0;
g.in_eof = 0;
g.in_short = 0;
g.in_tot = 0;
#ifndef NOTHREAD
g.in_which = -1;
#endif
} | in_init | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
unsigned int inb(void *desc, unsigned char **buf) {
unsigned int result;
if (!g.in_left)
load();
*buf = g.in_next;
if (g.in_left > 0xFFFFFFFF)
result = -1;
else
result = g.in_left;
g.in_next += result;
g.in_left -= result;
return result;
} | local unsigned inb(void *desc, unsigned char **buf) {
(void)desc;
if (g.in_left == 0)
load();
*buf = g.in_next;
unsigned len = g.in_left > UINT_MAX ? UINT_MAX : (unsigned)g.in_left;
g.in_next += len;
g.in_left -= len;
return len;
} | inb | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void infchk() {
unsigned long v0;
unsigned long v1;
unsigned char *v2;
unsigned int v3;
unsigned char *v4;
int v5;
unsigned char *v6;
unsigned int v7;
unsigned char *v8;
int v9;
unsigned char *v10;
unsigned int v11;
unsigned char *v12;
int v13;
unsigned char *v14;
unsigned int v15;
uns... | local void infchk(void) {
int ret, cont, more;
unsigned long check, len, ktot;
z_stream strm;
unsigned tmp2;
unsigned long tmp4;
length_t clen, ctot, utot;
ctot = utot = 0;
ktot = CHECK(0L, Z_NULL, 0);
cont = more = 0;
do {
g.in_tot = g.in_left;
g.out_tot = 0;
g.out_check = CHECK(0L, Z... | infchk | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void join_(thread *ally, const char *file, long line) {
int ret;
thread **prior;
thread *match;
ret = pthread_join(ally->id, 0);
if (ret)
fail(ret, file, line, "join");
possess_(&threads_lock, file, line);
for (prior = &threads;; prior = &match->next) {
match = *prior;
if (!*prior || match ==... | void join_(thread *ally, char const *file, long line) {
int ret = pthread_join(ally->id, NULL);
if (ret)
fail(ret, file, line, "join");
possess_(&(threads_lock), file, line);
thread **prior = &(threads);
thread *match;
while ((match = *prior) != NULL) {
if (match == ally)
break;
prior = ... | join_ | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int join_all_(const char *file, long line) {
int count;
int ret;
thread **prior;
thread *match;
count = 0;
possess_(&threads_lock, file, line);
while (threads) {
wait_for_(&threads_lock, wait_op_NOT_TO_BE, 0, file, line);
for (prior = &threads;; prior = &match->next) {
match = *prior;
... | int join_all_(char const *file, long line) {
int count = 0;
possess_(&(threads_lock), file, line);
while (threads != NULL) {
wait_for_(&(threads_lock), NOT_TO_BE, 0, file, line);
thread **prior = &(threads);
thread *match;
while ((match = *prior) != NULL) {
if (match->done)
break... | join_all_ | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
char *justname(char *path) {
char *p;
p = strrchr(path, 47);
if (p)
return p + 1;
else
return path;
} | local char *justname(char *path) {
char *p;
p = strrchr(path, '/');
return p == NULL ? path : p + 1;
} | justname | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
thread *launch_(void (*probe)(void *), void *payload, const char *file,
long line) {
int ret;
int reta;
int retb;
int retc;
capsule *capsule;
thread *th;
pthread_attr_t attr;
unsigned long v14;
v14 = __readfsqword(0x28u);
capsule = (capsule *)my_malloc(0x20u, file, line);
capsule-... | thread *launch_(void (*probe)(void *), void *payload, char const *file,
long line) {
struct capsule *capsule = my_malloc(sizeof(struct capsule), file, line);
capsule->probe = probe;
capsule->payload = payload;
capsule->file = file;
capsule->line = line;
possess_(&(threads_lock), file, line... | launch_ | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void list_info() {
size_t v0;
unsigned char *v1;
size_t in_left;
int method;
unsigned long check;
length_t len;
length_t lena;
off_t at;
off_t ata;
off_t atb;
size_t n;
unsigned char tail[8];
unsigned long v13;
v13 = __readfsqword(0x28u);
in_init();
method = get_header(1);
if (method ... | local void list_info(void) {
int method;
size_t n;
off_t at;
unsigned char tail[8];
unsigned long check;
length_t len;
in_init();
method = get_header(1);
if (method < 0) {
complain(method == -6 ? "skipping: %s corrupt: header crc error"
: method == -1 ? "skipping: %s empty"
... | list_info | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
size_t load() {
unsigned char *in_buf;
if (g.in_short) {
g.in_eof = 1;
g.in_left = 0;
return 0;
} else {
if (g.procs <= 1) {
g.in_next = g.in_buf;
g.in_left = readn(g.ind, g.in_buf, 0x8000u);
} else {
if (g.in_which == -1) {
g.in_which = 1;
g.load_state = new... | local size_t load(void) {
if (g.in_short) {
g.in_eof = 1;
g.in_left = 0;
return 0;
}
#ifndef NOTHREAD
if (g.procs > 1) {
if (g.in_which == -1) {
g.in_which = 1;
g.load_state = new_lock(1);
g.load_thread = launch(load_read, NULL);
}
load_wait();
g.in_next = g.in_... | load | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void load_end() {
if (g.in_which != -1) {
possess_(g.load_state, "pigz.c", 2637);
wait_for_(g.load_state, wait_op_TO_BE, 0, "pigz.c", 2638);
twist_(g.load_state, twist_op_TO, 2, "pigz.c", 2639);
join_(g.load_thread, "pigz.c", 2642);
free_lock_(g.load_state, "pigz.c", 2643);
g.in_which = -1;
... | local void load_end(void) {
#ifndef NOTHREAD
if (g.in_which != -1) {
possess(g.load_state);
wait_for(g.load_state, TO_BE, 0);
twist(g.load_state, TO, 2);
join(g.load_thread);
free_lock(g.load_state);
g.in_which = -1;
}
#endif
g.in_left = 0;
g.in_short = 1;
g.in_eof = 1;
if (g.ind ... | load_end | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void load_read(void *dummy) {
unsigned char *in_buf;
size_t len;
int err_4;
int err_8;
char *err_16;
try_t_ try_this_;
unsigned long v7;
v7 = __readfsqword(0x28u);
try_this_.ball.ret = 0;
try_this_.ball.code = 0;
try_this_.ball.free = 0;
try_this_.ball.why = 0;
try_setup_();
try_this_.next ... | local void load_read(void *dummy) {
size_t len;
ball_t err;
(void)dummy;
Trace(("-- launched decompress read thread"));
try {
do {
possess(g.load_state);
wait_for(g.load_state, NOT_TO_BE, 0);
if (peek_lock(g.load_state) > 1) {
release(g.load_state);
break;
}
... | load_read | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void load_wait() {
if (g.in_which != -1) {
possess_(g.load_state, "pigz.c", 2556);
wait_for_(g.load_state, wait_op_TO_BE, 0, "pigz.c", 2557);
release_(g.load_state, "pigz.c", 2558);
}
} | local void load_wait(void) {
if (g.in_which == -1)
return;
possess(g.load_state);
wait_for(g.load_state, TO_BE, 0);
release(g.load_state);
} | load_wait | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int main(int argc, const char **argv, const char **envp) {
char *v3;
char *v4;
int n;
int na;
int nb;
int nc;
int nop;
int done;
char *opts;
char *optsa;
char *p;
char *pa;
char *pb;
size_t k;
int err_4;
int err_8;
char *err_16;
try_t_ try_this_;
unsigned long v22;
v22 = __readf... | int main(int argc, char **argv) {
int n;
int nop;
int done;
size_t k;
char *opts, *p;
ball_t err;
g.ret = 0;
try {
g.inf = NULL;
g.inz = 0;
#ifndef NOTHREAD
g.in_which = -1;
#endif
g.alias = "-";
g.outf = NULL;
g.first = 1;
g.hname = NULL;
g.hcomm = NULL;
p = strrc... | main | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
void message(char *fmt, __va_list_tag *ap) {
if (g.verbosity > 0) {
fprintf(stderr, "%s: ", g.prog);
vfprintf(stderr, fmt, ap);
putc(10, stderr);
fflush(stderr);
}
} | local void message(char *fmt, va_list ap) {
if (g.verbosity > 0) {
fprintf(stderr, "%s: ", g.prog);
vfprintf(stderr, fmt, ap);
putc('\n', stderr);
fflush(stderr);
}
} | message | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
int more_zip_entries() {
unsigned char *v0;
unsigned int v1;
unsigned char *v2;
int v3;
unsigned char *v4;
unsigned int v5;
unsigned char *v6;
int v7;
int result;
int v9;
int n;
unsigned int tmp2;
unsigned int tmp2a;
int ret;
size_t need;
size_t needa;
size_t part;
size_t i;
unsign... | local int more_zip_entries(void) {
unsigned long sig;
int ret, n;
unsigned char *first;
unsigned tmp2;
unsigned long tmp4;
unsigned char const central[] = {0x50, 0x4b, 1, 2};
sig = GET4();
ret = !g.in_eof && sig == 0x04034b50;
if (!g.list || g.verbosity < 2)
return ret;
n = sig == 0x02014b50 ?... | more_zip_entries | pigz-2.7 | app-arch | O0/app-arch/pigz-2.7/pigz | ida | O0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.