Christian Decker
6 years ago
979 changed files with 223610 additions and 0 deletions
@ -0,0 +1,4 @@ |
|||
language: c |
|||
sudo: false |
|||
script: |
|||
- make test |
@ -0,0 +1,20 @@ |
|||
Copyright (c) 2010 Serge A. Zaitsev |
|||
|
|||
Permission is hereby granted, free of charge, to any person obtaining a copy |
|||
of this software and associated documentation files (the "Software"), to deal |
|||
in the Software without restriction, including without limitation the rights |
|||
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
|||
copies of the Software, and to permit persons to whom the Software is |
|||
furnished to do so, subject to the following conditions: |
|||
|
|||
The above copyright notice and this permission notice shall be included in |
|||
all copies or substantial portions of the Software. |
|||
|
|||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|||
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|||
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|||
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
|||
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
|||
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
|||
THE SOFTWARE. |
|||
|
@ -0,0 +1,41 @@ |
|||
# You can put your build options here
|
|||
-include config.mk |
|||
|
|||
all: libjsmn.a |
|||
|
|||
libjsmn.a: jsmn.o |
|||
$(AR) rc $@ $^ |
|||
|
|||
%.o: %.c jsmn.h |
|||
$(CC) -c $(CFLAGS) $< -o $@ |
|||
|
|||
test: test_default test_strict test_links test_strict_links |
|||
test_default: test/tests.c |
|||
$(CC) $(CFLAGS) $(LDFLAGS) $< -o test/$@ |
|||
./test/$@ |
|||
test_strict: test/tests.c |
|||
$(CC) -DJSMN_STRICT=1 $(CFLAGS) $(LDFLAGS) $< -o test/$@ |
|||
./test/$@ |
|||
test_links: test/tests.c |
|||
$(CC) -DJSMN_PARENT_LINKS=1 $(CFLAGS) $(LDFLAGS) $< -o test/$@ |
|||
./test/$@ |
|||
test_strict_links: test/tests.c |
|||
$(CC) -DJSMN_STRICT=1 -DJSMN_PARENT_LINKS=1 $(CFLAGS) $(LDFLAGS) $< -o test/$@ |
|||
./test/$@ |
|||
|
|||
jsmn_test.o: jsmn_test.c libjsmn.a |
|||
|
|||
simple_example: example/simple.o libjsmn.a |
|||
$(CC) $(LDFLAGS) $^ -o $@ |
|||
|
|||
jsondump: example/jsondump.o libjsmn.a |
|||
$(CC) $(LDFLAGS) $^ -o $@ |
|||
|
|||
clean: |
|||
rm -f *.o example/*.o |
|||
rm -f *.a *.so |
|||
rm -f simple_example |
|||
rm -f jsondump |
|||
|
|||
.PHONY: all clean test |
|||
|
@ -0,0 +1,168 @@ |
|||
JSMN |
|||
==== |
|||
|
|||
[![Build Status](https://travis-ci.org/zserge/jsmn.svg?branch=master)](https://travis-ci.org/zserge/jsmn) |
|||
|
|||
jsmn (pronounced like 'jasmine') is a minimalistic JSON parser in C. It can be |
|||
easily integrated into resource-limited or embedded projects. |
|||
|
|||
You can find more information about JSON format at [json.org][1] |
|||
|
|||
Library sources are available at https://github.com/zserge/jsmn |
|||
|
|||
The web page with some information about jsmn can be found at |
|||
[http://zserge.com/jsmn.html][2] |
|||
|
|||
Philosophy |
|||
---------- |
|||
|
|||
Most JSON parsers offer you a bunch of functions to load JSON data, parse it |
|||
and extract any value by its name. jsmn proves that checking the correctness of |
|||
every JSON packet or allocating temporary objects to store parsed JSON fields |
|||
often is an overkill. |
|||
|
|||
JSON format itself is extremely simple, so why should we complicate it? |
|||
|
|||
jsmn is designed to be **robust** (it should work fine even with erroneous |
|||
data), **fast** (it should parse data on the fly), **portable** (no superfluous |
|||
dependencies or non-standard C extensions). And of course, **simplicity** is a |
|||
key feature - simple code style, simple algorithm, simple integration into |
|||
other projects. |
|||
|
|||
Features |
|||
-------- |
|||
|
|||
* compatible with C89 |
|||
* no dependencies (even libc!) |
|||
* highly portable (tested on x86/amd64, ARM, AVR) |
|||
* about 200 lines of code |
|||
* extremely small code footprint |
|||
* API contains only 2 functions |
|||
* no dynamic memory allocation |
|||
* incremental single-pass parsing |
|||
* library code is covered with unit-tests |
|||
|
|||
Design |
|||
------ |
|||
|
|||
The rudimentary jsmn object is a **token**. Let's consider a JSON string: |
|||
|
|||
'{ "name" : "Jack", "age" : 27 }' |
|||
|
|||
It holds the following tokens: |
|||
|
|||
* Object: `{ "name" : "Jack", "age" : 27}` (the whole object) |
|||
* Strings: `"name"`, `"Jack"`, `"age"` (keys and some values) |
|||
* Number: `27` |
|||
|
|||
In jsmn, tokens do not hold any data, but point to token boundaries in JSON |
|||
string instead. In the example above jsmn will create tokens like: Object |
|||
[0..31], String [3..7], String [12..16], String [20..23], Number [27..29]. |
|||
|
|||
Every jsmn token has a type, which indicates the type of corresponding JSON |
|||
token. jsmn supports the following token types: |
|||
|
|||
* Object - a container of key-value pairs, e.g.: |
|||
`{ "foo":"bar", "x":0.3 }` |
|||
* Array - a sequence of values, e.g.: |
|||
`[ 1, 2, 3 ]` |
|||
* String - a quoted sequence of chars, e.g.: `"foo"` |
|||
* Primitive - a number, a boolean (`true`, `false`) or `null` |
|||
|
|||
Besides start/end positions, jsmn tokens for complex types (like arrays |
|||
or objects) also contain a number of child items, so you can easily follow |
|||
object hierarchy. |
|||
|
|||
This approach provides enough information for parsing any JSON data and makes |
|||
it possible to use zero-copy techniques. |
|||
|
|||
Install |
|||
------- |
|||
|
|||
To clone the repository you should have Git installed. Just run: |
|||
|
|||
$ git clone https://github.com/zserge/jsmn |
|||
|
|||
Repository layout is simple: jsmn.c and jsmn.h are library files, tests are in |
|||
the jsmn\_test.c, you will also find README, LICENSE and Makefile files inside. |
|||
|
|||
To build the library, run `make`. It is also recommended to run `make test`. |
|||
Let me know, if some tests fail. |
|||
|
|||
If build was successful, you should get a `libjsmn.a` library. |
|||
The header file you should include is called `"jsmn.h"`. |
|||
|
|||
API |
|||
--- |
|||
|
|||
Token types are described by `jsmntype_t`: |
|||
|
|||
typedef enum { |
|||
JSMN_UNDEFINED = 0, |
|||
JSMN_OBJECT = 1, |
|||
JSMN_ARRAY = 2, |
|||
JSMN_STRING = 3, |
|||
JSMN_PRIMITIVE = 4 |
|||
} jsmntype_t; |
|||
|
|||
**Note:** Unlike JSON data types, primitive tokens are not divided into |
|||
numbers, booleans and null, because one can easily tell the type using the |
|||
first character: |
|||
|
|||
* <code>'t', 'f'</code> - boolean |
|||
* <code>'n'</code> - null |
|||
* <code>'-', '0'..'9'</code> - number |
|||
|
|||
Token is an object of `jsmntok_t` type: |
|||
|
|||
typedef struct { |
|||
jsmntype_t type; // Token type |
|||
int start; // Token start position |
|||
int end; // Token end position |
|||
int size; // Number of child (nested) tokens |
|||
} jsmntok_t; |
|||
|
|||
**Note:** string tokens point to the first character after |
|||
the opening quote and the previous symbol before final quote. This was made |
|||
to simplify string extraction from JSON data. |
|||
|
|||
All job is done by `jsmn_parser` object. You can initialize a new parser using: |
|||
|
|||
jsmn_parser parser; |
|||
jsmntok_t tokens[10]; |
|||
|
|||
jsmn_init(&parser); |
|||
|
|||
// js - pointer to JSON string |
|||
// tokens - an array of tokens available |
|||
// 10 - number of tokens available |
|||
jsmn_parse(&parser, js, strlen(js), tokens, 10); |
|||
|
|||
This will create a parser, and then it tries to parse up to 10 JSON tokens from |
|||
the `js` string. |
|||
|
|||
A non-negative return value of `jsmn_parse` is the number of tokens actually |
|||
used by the parser. |
|||
Passing NULL instead of the tokens array would not store parsing results, but |
|||
instead the function will return the value of tokens needed to parse the given |
|||
string. This can be useful if you don't know yet how many tokens to allocate. |
|||
|
|||
If something goes wrong, you will get an error. Error will be one of these: |
|||
|
|||
* `JSMN_ERROR_INVAL` - bad token, JSON string is corrupted |
|||
* `JSMN_ERROR_NOMEM` - not enough tokens, JSON string is too large |
|||
* `JSMN_ERROR_PART` - JSON string is too short, expecting more JSON data |
|||
|
|||
If you get `JSMN_ERROR_NOMEM`, you can re-allocate more tokens and call |
|||
`jsmn_parse` once more. If you read json data from the stream, you can |
|||
periodically call `jsmn_parse` and check if return value is `JSMN_ERROR_PART`. |
|||
You will get this error until you reach the end of JSON data. |
|||
|
|||
Other info |
|||
---------- |
|||
|
|||
This software is distributed under [MIT license](http://www.opensource.org/licenses/mit-license.php), |
|||
so feel free to integrate it in your commercial products. |
|||
|
|||
[1]: http://www.json.org/ |
|||
[2]: http://zserge.com/jsmn.html |
@ -0,0 +1,126 @@ |
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <unistd.h> |
|||
#include <string.h> |
|||
#include <errno.h> |
|||
#include "../jsmn.h" |
|||
|
|||
/* Function realloc_it() is a wrapper function for standart realloc()
|
|||
* with one difference - it frees old memory pointer in case of realloc |
|||
* failure. Thus, DO NOT use old data pointer in anyway after call to |
|||
* realloc_it(). If your code has some kind of fallback algorithm if |
|||
* memory can't be re-allocated - use standart realloc() instead. |
|||
*/ |
|||
static inline void *realloc_it(void *ptrmem, size_t size) { |
|||
void *p = realloc(ptrmem, size); |
|||
if (!p) { |
|||
free (ptrmem); |
|||
fprintf(stderr, "realloc(): errno=%d\n", errno); |
|||
} |
|||
return p; |
|||
} |
|||
|
|||
/*
|
|||
* An example of reading JSON from stdin and printing its content to stdout. |
|||
* The output looks like YAML, but I'm not sure if it's really compatible. |
|||
*/ |
|||
|
|||
static int dump(const char *js, jsmntok_t *t, size_t count, int indent) { |
|||
int i, j, k; |
|||
if (count == 0) { |
|||
return 0; |
|||
} |
|||
if (t->type == JSMN_PRIMITIVE) { |
|||
printf("%.*s", t->end - t->start, js+t->start); |
|||
return 1; |
|||
} else if (t->type == JSMN_STRING) { |
|||
printf("'%.*s'", t->end - t->start, js+t->start); |
|||
return 1; |
|||
} else if (t->type == JSMN_OBJECT) { |
|||
printf("\n"); |
|||
j = 0; |
|||
for (i = 0; i < t->size; i++) { |
|||
for (k = 0; k < indent; k++) printf(" "); |
|||
j += dump(js, t+1+j, count-j, indent+1); |
|||
printf(": "); |
|||
j += dump(js, t+1+j, count-j, indent+1); |
|||
printf("\n"); |
|||
} |
|||
return j+1; |
|||
} else if (t->type == JSMN_ARRAY) { |
|||
j = 0; |
|||
printf("\n"); |
|||
for (i = 0; i < t->size; i++) { |
|||
for (k = 0; k < indent-1; k++) printf(" "); |
|||
printf(" - "); |
|||
j += dump(js, t+1+j, count-j, indent+1); |
|||
printf("\n"); |
|||
} |
|||
return j+1; |
|||
} |
|||
return 0; |
|||
} |
|||
|
|||
int main() { |
|||
int r; |
|||
int eof_expected = 0; |
|||
char *js = NULL; |
|||
size_t jslen = 0; |
|||
char buf[BUFSIZ]; |
|||
|
|||
jsmn_parser p; |
|||
jsmntok_t *tok; |
|||
size_t tokcount = 2; |
|||
|
|||
/* Prepare parser */ |
|||
jsmn_init(&p); |
|||
|
|||
/* Allocate some tokens as a start */ |
|||
tok = malloc(sizeof(*tok) * tokcount); |
|||
if (tok == NULL) { |
|||
fprintf(stderr, "malloc(): errno=%d\n", errno); |
|||
return 3; |
|||
} |
|||
|
|||
for (;;) { |
|||
/* Read another chunk */ |
|||
r = fread(buf, 1, sizeof(buf), stdin); |
|||
if (r < 0) { |
|||
fprintf(stderr, "fread(): %d, errno=%d\n", r, errno); |
|||
return 1; |
|||
} |
|||
if (r == 0) { |
|||
if (eof_expected != 0) { |
|||
return 0; |
|||
} else { |
|||
fprintf(stderr, "fread(): unexpected EOF\n"); |
|||
return 2; |
|||
} |
|||
} |
|||
|
|||
js = realloc_it(js, jslen + r + 1); |
|||
if (js == NULL) { |
|||
return 3; |
|||
} |
|||
strncpy(js + jslen, buf, r); |
|||
jslen = jslen + r; |
|||
|
|||
again: |
|||
r = jsmn_parse(&p, js, jslen, tok, tokcount); |
|||
if (r < 0) { |
|||
if (r == JSMN_ERROR_NOMEM) { |
|||
tokcount = tokcount * 2; |
|||
tok = realloc_it(tok, sizeof(*tok) * tokcount); |
|||
if (tok == NULL) { |
|||
return 3; |
|||
} |
|||
goto again; |
|||
} |
|||
} else { |
|||
dump(js, tok, p.toknext, 0); |
|||
eof_expected = 1; |
|||
} |
|||
} |
|||
|
|||
return EXIT_SUCCESS; |
|||
} |
@ -0,0 +1,76 @@ |
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
#include "../jsmn.h" |
|||
|
|||
/*
|
|||
* A small example of jsmn parsing when JSON structure is known and number of |
|||
* tokens is predictable. |
|||
*/ |
|||
|
|||
static const char *JSON_STRING = |
|||
"{\"user\": \"johndoe\", \"admin\": false, \"uid\": 1000,\n " |
|||
"\"groups\": [\"users\", \"wheel\", \"audio\", \"video\"]}"; |
|||
|
|||
static int jsoneq(const char *json, jsmntok_t *tok, const char *s) { |
|||
if (tok->type == JSMN_STRING && (int) strlen(s) == tok->end - tok->start && |
|||
strncmp(json + tok->start, s, tok->end - tok->start) == 0) { |
|||
return 0; |
|||
} |
|||
return -1; |
|||
} |
|||
|
|||
int main() { |
|||
int i; |
|||
int r; |
|||
jsmn_parser p; |
|||
jsmntok_t t[128]; /* We expect no more than 128 tokens */ |
|||
|
|||
jsmn_init(&p); |
|||
r = jsmn_parse(&p, JSON_STRING, strlen(JSON_STRING), t, sizeof(t)/sizeof(t[0])); |
|||
if (r < 0) { |
|||
printf("Failed to parse JSON: %d\n", r); |
|||
return 1; |
|||
} |
|||
|
|||
/* Assume the top-level element is an object */ |
|||
if (r < 1 || t[0].type != JSMN_OBJECT) { |
|||
printf("Object expected\n"); |
|||
return 1; |
|||
} |
|||
|
|||
/* Loop over all keys of the root object */ |
|||
for (i = 1; i < r; i++) { |
|||
if (jsoneq(JSON_STRING, &t[i], "user") == 0) { |
|||
/* We may use strndup() to fetch string value */ |
|||
printf("- User: %.*s\n", t[i+1].end-t[i+1].start, |
|||
JSON_STRING + t[i+1].start); |
|||
i++; |
|||
} else if (jsoneq(JSON_STRING, &t[i], "admin") == 0) { |
|||
/* We may additionally check if the value is either "true" or "false" */ |
|||
printf("- Admin: %.*s\n", t[i+1].end-t[i+1].start, |
|||
JSON_STRING + t[i+1].start); |
|||
i++; |
|||
} else if (jsoneq(JSON_STRING, &t[i], "uid") == 0) { |
|||
/* We may want to do strtol() here to get numeric value */ |
|||
printf("- UID: %.*s\n", t[i+1].end-t[i+1].start, |
|||
JSON_STRING + t[i+1].start); |
|||
i++; |
|||
} else if (jsoneq(JSON_STRING, &t[i], "groups") == 0) { |
|||
int j; |
|||
printf("- Groups:\n"); |
|||
if (t[i+1].type != JSMN_ARRAY) { |
|||
continue; /* We expect groups to be an array of strings */ |
|||
} |
|||
for (j = 0; j < t[i+1].size; j++) { |
|||
jsmntok_t *g = &t[i+j+2]; |
|||
printf(" * %.*s\n", g->end - g->start, JSON_STRING + g->start); |
|||
} |
|||
i += t[i+1].size + 1; |
|||
} else { |
|||
printf("Unexpected key: %.*s\n", t[i].end-t[i].start, |
|||
JSON_STRING + t[i].start); |
|||
} |
|||
} |
|||
return EXIT_SUCCESS; |
|||
} |
@ -0,0 +1,314 @@ |
|||
#include "jsmn.h" |
|||
|
|||
/**
|
|||
* Allocates a fresh unused token from the token pull. |
|||
*/ |
|||
static jsmntok_t *jsmn_alloc_token(jsmn_parser *parser, |
|||
jsmntok_t *tokens, size_t num_tokens) { |
|||
jsmntok_t *tok; |
|||
if (parser->toknext >= num_tokens) { |
|||
return NULL; |
|||
} |
|||
tok = &tokens[parser->toknext++]; |
|||
tok->start = tok->end = -1; |
|||
tok->size = 0; |
|||
#ifdef JSMN_PARENT_LINKS |
|||
tok->parent = -1; |
|||
#endif |
|||
return tok; |
|||
} |
|||
|
|||
/**
|
|||
* Fills token type and boundaries. |
|||
*/ |
|||
static void jsmn_fill_token(jsmntok_t *token, jsmntype_t type, |
|||
int start, int end) { |
|||
token->type = type; |
|||
token->start = start; |
|||
token->end = end; |
|||
token->size = 0; |
|||
} |
|||
|
|||
/**
|
|||
* Fills next available token with JSON primitive. |
|||
*/ |
|||
static int jsmn_parse_primitive(jsmn_parser *parser, const char *js, |
|||
size_t len, jsmntok_t *tokens, size_t num_tokens) { |
|||
jsmntok_t *token; |
|||
int start; |
|||
|
|||
start = parser->pos; |
|||
|
|||
for (; parser->pos < len && js[parser->pos] != '\0'; parser->pos++) { |
|||
switch (js[parser->pos]) { |
|||
#ifndef JSMN_STRICT |
|||
/* In strict mode primitive must be followed by "," or "}" or "]" */ |
|||
case ':': |
|||
#endif |
|||
case '\t' : case '\r' : case '\n' : case ' ' : |
|||
case ',' : case ']' : case '}' : |
|||
goto found; |
|||
} |
|||
if (js[parser->pos] < 32 || js[parser->pos] >= 127) { |
|||
parser->pos = start; |
|||
return JSMN_ERROR_INVAL; |
|||
} |
|||
} |
|||
#ifdef JSMN_STRICT |
|||
/* In strict mode primitive must be followed by a comma/object/array */ |
|||
parser->pos = start; |
|||
return JSMN_ERROR_PART; |
|||
#endif |
|||
|
|||
found: |
|||
if (tokens == NULL) { |
|||
parser->pos--; |
|||
return 0; |
|||
} |
|||
token = jsmn_alloc_token(parser, tokens, num_tokens); |
|||
if (token == NULL) { |
|||
parser->pos = start; |
|||
return JSMN_ERROR_NOMEM; |
|||
} |
|||
jsmn_fill_token(token, JSMN_PRIMITIVE, start, parser->pos); |
|||
#ifdef JSMN_PARENT_LINKS |
|||
token->parent = parser->toksuper; |
|||
#endif |
|||
parser->pos--; |
|||
return 0; |
|||
} |
|||
|
|||
/**
|
|||
* Fills next token with JSON string. |
|||
*/ |
|||
static int jsmn_parse_string(jsmn_parser *parser, const char *js, |
|||
size_t len, jsmntok_t *tokens, size_t num_tokens) { |
|||
jsmntok_t *token; |
|||
|
|||
int start = parser->pos; |
|||
|
|||
parser->pos++; |
|||
|
|||
/* Skip starting quote */ |
|||
for (; parser->pos < len && js[parser->pos] != '\0'; parser->pos++) { |
|||
char c = js[parser->pos]; |
|||
|
|||
/* Quote: end of string */ |
|||
if (c == '\"') { |
|||
if (tokens == NULL) { |
|||
return 0; |
|||
} |
|||
token = jsmn_alloc_token(parser, tokens, num_tokens); |
|||
if (token == NULL) { |
|||
parser->pos = start; |
|||
return JSMN_ERROR_NOMEM; |
|||
} |
|||
jsmn_fill_token(token, JSMN_STRING, start+1, parser->pos); |
|||
#ifdef JSMN_PARENT_LINKS |
|||
token->parent = parser->toksuper; |
|||
#endif |
|||
return 0; |
|||
} |
|||
|
|||
/* Backslash: Quoted symbol expected */ |
|||
if (c == '\\' && parser->pos + 1 < len) { |
|||
int i; |
|||
parser->pos++; |
|||
switch (js[parser->pos]) { |
|||
/* Allowed escaped symbols */ |
|||
case '\"': case '/' : case '\\' : case 'b' : |
|||
case 'f' : case 'r' : case 'n' : case 't' : |
|||
break; |
|||
/* Allows escaped symbol \uXXXX */ |
|||
case 'u': |
|||
parser->pos++; |
|||
for(i = 0; i < 4 && parser->pos < len && js[parser->pos] != '\0'; i++) { |
|||
/* If it isn't a hex character we have an error */ |
|||
if(!((js[parser->pos] >= 48 && js[parser->pos] <= 57) || /* 0-9 */ |
|||
(js[parser->pos] >= 65 && js[parser->pos] <= 70) || /* A-F */ |
|||
(js[parser->pos] >= 97 && js[parser->pos] <= 102))) { /* a-f */ |
|||
parser->pos = start; |
|||
return JSMN_ERROR_INVAL; |
|||
} |
|||
parser->pos++; |
|||
} |
|||
parser->pos--; |
|||
break; |
|||
/* Unexpected symbol */ |
|||
default: |
|||
parser->pos = start; |
|||
return JSMN_ERROR_INVAL; |
|||
} |
|||
} |
|||
} |
|||
parser->pos = start; |
|||
return JSMN_ERROR_PART; |
|||
} |
|||
|
|||
/**
|
|||
* Parse JSON string and fill tokens. |
|||
*/ |
|||
int jsmn_parse(jsmn_parser *parser, const char *js, size_t len, |
|||
jsmntok_t *tokens, unsigned int num_tokens) { |
|||
int r; |
|||
int i; |
|||
jsmntok_t *token; |
|||
int count = parser->toknext; |
|||
|
|||
for (; parser->pos < len && js[parser->pos] != '\0'; parser->pos++) { |
|||
char c; |
|||
jsmntype_t type; |
|||
|
|||
c = js[parser->pos]; |
|||
switch (c) { |
|||
case '{': case '[': |
|||
count++; |
|||
if (tokens == NULL) { |
|||
break; |
|||
} |
|||
token = jsmn_alloc_token(parser, tokens, num_tokens); |
|||
if (token == NULL) |
|||
return JSMN_ERROR_NOMEM; |
|||
if (parser->toksuper != -1) { |
|||
tokens[parser->toksuper].size++; |
|||
#ifdef JSMN_PARENT_LINKS |
|||
token->parent = parser->toksuper; |
|||
#endif |
|||
} |
|||
token->type = (c == '{' ? JSMN_OBJECT : JSMN_ARRAY); |
|||
token->start = parser->pos; |
|||
parser->toksuper = parser->toknext - 1; |
|||
break; |
|||
case '}': case ']': |
|||
if (tokens == NULL) |
|||
break; |
|||
type = (c == '}' ? JSMN_OBJECT : JSMN_ARRAY); |
|||
#ifdef JSMN_PARENT_LINKS |
|||
if (parser->toknext < 1) { |
|||
return JSMN_ERROR_INVAL; |
|||
} |
|||
token = &tokens[parser->toknext - 1]; |
|||
for (;;) { |
|||
if (token->start != -1 && token->end == -1) { |
|||
if (token->type != type) { |
|||
return JSMN_ERROR_INVAL; |
|||
} |
|||
token->end = parser->pos + 1; |
|||
parser->toksuper = token->parent; |
|||
break; |
|||
} |
|||
if (token->parent == -1) { |
|||
if(token->type != type || parser->toksuper == -1) { |
|||
return JSMN_ERROR_INVAL; |
|||
} |
|||
break; |
|||
} |
|||
token = &tokens[token->parent]; |
|||
} |
|||
#else |
|||
for (i = parser->toknext - 1; i >= 0; i--) { |
|||
token = &tokens[i]; |
|||
if (token->start != -1 && token->end == -1) { |
|||
if (token->type != type) { |
|||
return JSMN_ERROR_INVAL; |
|||
} |
|||
parser->toksuper = -1; |
|||
token->end = parser->pos + 1; |
|||
break; |
|||
} |
|||
} |
|||
/* Error if unmatched closing bracket */ |
|||
if (i == -1) return JSMN_ERROR_INVAL; |
|||
for (; i >= 0; i--) { |
|||
token = &tokens[i]; |
|||
if (token->start != -1 && token->end == -1) { |
|||
parser->toksuper = i; |
|||
break; |
|||
} |
|||
} |
|||
#endif |
|||
break; |
|||
case '\"': |
|||
r = jsmn_parse_string(parser, js, len, tokens, num_tokens); |
|||
if (r < 0) return r; |
|||
count++; |
|||
if (parser->toksuper != -1 && tokens != NULL) |
|||
tokens[parser->toksuper].size++; |
|||
break; |
|||
case '\t' : case '\r' : case '\n' : case ' ': |
|||
break; |
|||
case ':': |
|||
parser->toksuper = parser->toknext - 1; |
|||
break; |
|||
case ',': |
|||
if (tokens != NULL && parser->toksuper != -1 && |
|||
tokens[parser->toksuper].type != JSMN_ARRAY && |
|||
tokens[parser->toksuper].type != JSMN_OBJECT) { |
|||
#ifdef JSMN_PARENT_LINKS |
|||
parser->toksuper = tokens[parser->toksuper].parent; |
|||
#else |
|||
for (i = parser->toknext - 1; i >= 0; i--) { |
|||
if (tokens[i].type == JSMN_ARRAY || tokens[i].type == JSMN_OBJECT) { |
|||
if (tokens[i].start != -1 && tokens[i].end == -1) { |
|||
parser->toksuper = i; |
|||
break; |
|||
} |
|||
} |
|||
} |
|||
#endif |
|||
} |
|||
break; |
|||
#ifdef JSMN_STRICT |
|||
/* In strict mode primitives are: numbers and booleans */ |
|||
case '-': case '0': case '1' : case '2': case '3' : case '4': |
|||
case '5': case '6': case '7' : case '8': case '9': |
|||
case 't': case 'f': case 'n' : |
|||
/* And they must not be keys of the object */ |
|||
if (tokens != NULL && parser->toksuper != -1) { |
|||
jsmntok_t *t = &tokens[parser->toksuper]; |
|||
if (t->type == JSMN_OBJECT || |
|||
(t->type == JSMN_STRING && t->size != 0)) { |
|||
return JSMN_ERROR_INVAL; |
|||
} |
|||
} |
|||
#else |
|||
/* In non-strict mode every unquoted value is a primitive */ |
|||
default: |
|||
#endif |
|||
r = jsmn_parse_primitive(parser, js, len, tokens, num_tokens); |
|||
if (r < 0) return r; |
|||
count++; |
|||
if (parser->toksuper != -1 && tokens != NULL) |
|||
tokens[parser->toksuper].size++; |
|||
break; |
|||
|
|||
#ifdef JSMN_STRICT |
|||
/* Unexpected char in strict mode */ |
|||
default: |
|||
return JSMN_ERROR_INVAL; |
|||
#endif |
|||
} |
|||
} |
|||
|
|||
if (tokens != NULL) { |
|||
for (i = parser->toknext - 1; i >= 0; i--) { |
|||
/* Unmatched opened object or array */ |
|||
if (tokens[i].start != -1 && tokens[i].end == -1) { |
|||
return JSMN_ERROR_PART; |
|||
} |
|||
} |
|||
} |
|||
|
|||
return count; |
|||
} |
|||
|
|||
/**
|
|||
* Creates a new parser based over a given buffer with an array of tokens |
|||
* available. |
|||
*/ |
|||
void jsmn_init(jsmn_parser *parser) { |
|||
parser->pos = 0; |
|||
parser->toknext = 0; |
|||
parser->toksuper = -1; |
|||
} |
|||
|
@ -0,0 +1,76 @@ |
|||
#ifndef __JSMN_H_ |
|||
#define __JSMN_H_ |
|||
|
|||
#include <stddef.h> |
|||
|
|||
#ifdef __cplusplus |
|||
extern "C" { |
|||
#endif |
|||
|
|||
/**
|
|||
* JSON type identifier. Basic types are: |
|||
* o Object |
|||
* o Array |
|||
* o String |
|||
* o Other primitive: number, boolean (true/false) or null |
|||
*/ |
|||
typedef enum { |
|||
JSMN_UNDEFINED = 0, |
|||
JSMN_OBJECT = 1, |
|||
JSMN_ARRAY = 2, |
|||
JSMN_STRING = 3, |
|||
JSMN_PRIMITIVE = 4 |
|||
} jsmntype_t; |
|||
|
|||
enum jsmnerr { |
|||
/* Not enough tokens were provided */ |
|||
JSMN_ERROR_NOMEM = -1, |
|||
/* Invalid character inside JSON string */ |
|||
JSMN_ERROR_INVAL = -2, |
|||
/* The string is not a full JSON packet, more bytes expected */ |
|||
JSMN_ERROR_PART = -3 |
|||
}; |
|||
|
|||
/**
|
|||
* JSON token description. |
|||
* type type (object, array, string etc.) |
|||
* start start position in JSON data string |
|||
* end end position in JSON data string |
|||
*/ |
|||
typedef struct { |
|||
jsmntype_t type; |
|||
int start; |
|||
int end; |
|||
int size; |
|||
#ifdef JSMN_PARENT_LINKS |
|||
int parent; |
|||
#endif |
|||
} jsmntok_t; |
|||
|
|||
/**
|
|||
* JSON parser. Contains an array of token blocks available. Also stores |
|||
* the string being parsed now and current position in that string |
|||
*/ |
|||
typedef struct { |
|||
unsigned int pos; /* offset in the JSON string */ |
|||
unsigned int toknext; /* next token to allocate */ |
|||
int toksuper; /* superior token node, e.g parent object or array */ |
|||
} jsmn_parser; |
|||
|
|||
/**
|
|||
* Create JSON parser over an array of tokens |
|||
*/ |
|||
void jsmn_init(jsmn_parser *parser); |
|||
|
|||
/**
|
|||
* Run JSON parser. It parses a JSON data string into and array of tokens, each describing |
|||
* a single JSON object. |
|||
*/ |
|||
int jsmn_parse(jsmn_parser *parser, const char *js, size_t len, |
|||
jsmntok_t *tokens, unsigned int num_tokens); |
|||
|
|||
#ifdef __cplusplus |
|||
} |
|||
#endif |
|||
|
|||
#endif /* __JSMN_H_ */ |
@ -0,0 +1,16 @@ |
|||
{ |
|||
"name": "jsmn", |
|||
"keywords": "json", |
|||
"description": "Minimalistic JSON parser/tokenizer in C. It can be easily integrated into resource-limited or embedded projects", |
|||
"repository": |
|||
{ |
|||
"type": "git", |
|||
"url": "https://github.com/zserge/jsmn.git" |
|||
}, |
|||
"frameworks": "*", |
|||
"platforms": "*", |
|||
"examples": [ |
|||
"example/*.c" |
|||
], |
|||
"exclude": "test" |
|||
} |
@ -0,0 +1,27 @@ |
|||
#ifndef __TEST_H__ |
|||
#define __TEST_H__ |
|||
|
|||
static int test_passed = 0; |
|||
static int test_failed = 0; |
|||
|
|||
/* Terminate current test with error */ |
|||
#define fail() return __LINE__ |
|||
|
|||
/* Successful end of the test case */ |
|||
#define done() return 0 |
|||
|
|||
/* Check single condition */ |
|||
#define check(cond) do { if (!(cond)) fail(); } while (0) |
|||
|
|||
/* Test runner */ |
|||
static void test(int (*func)(void), const char *name) { |
|||
int r = func(); |
|||
if (r == 0) { |
|||
test_passed++; |
|||
} else { |
|||
test_failed++; |
|||
printf("FAILED: %s (at line %d)\n", name, r); |
|||
} |
|||
} |
|||
|
|||
#endif /* __TEST_H__ */ |
@ -0,0 +1,407 @@ |
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
#include <stdarg.h> |
|||
|
|||
#include "test.h" |
|||
#include "testutil.h" |
|||
|
|||
int test_empty(void) { |
|||
check(parse("{}", 1, 1, |
|||
JSMN_OBJECT, 0, 2, 0)); |
|||
check(parse("[]", 1, 1, |
|||
JSMN_ARRAY, 0, 2, 0)); |
|||
check(parse("[{},{}]", 3, 3, |
|||
JSMN_ARRAY, 0, 7, 2, |
|||
JSMN_OBJECT, 1, 3, 0, |
|||
JSMN_OBJECT, 4, 6, 0)); |
|||
return 0; |
|||
} |
|||
|
|||
int test_object(void) { |
|||
check(parse("{\"a\":0}", 3, 3, |
|||
JSMN_OBJECT, 0, 7, 1, |
|||
JSMN_STRING, "a", 1, |
|||
JSMN_PRIMITIVE, "0")); |
|||
check(parse("{\"a\":[]}", 3, 3, |
|||
JSMN_OBJECT, 0, 8, 1, |
|||
JSMN_STRING, "a", 1, |
|||
JSMN_ARRAY, 5, 7, 0)); |
|||
check(parse("{\"a\":{},\"b\":{}}", 5, 5, |
|||
JSMN_OBJECT, -1, -1, 2, |
|||
JSMN_STRING, "a", 1, |
|||
JSMN_OBJECT, -1, -1, 0, |
|||
JSMN_STRING, "b", 1, |
|||
JSMN_OBJECT, -1, -1, 0)); |
|||
check(parse("{\n \"Day\": 26,\n \"Month\": 9,\n \"Year\": 12\n }", 7, 7, |
|||
JSMN_OBJECT, -1, -1, 3, |
|||
JSMN_STRING, "Day", 1, |
|||
JSMN_PRIMITIVE, "26", |
|||
JSMN_STRING, "Month", 1, |
|||
JSMN_PRIMITIVE, "9", |
|||
JSMN_STRING, "Year", 1, |
|||
JSMN_PRIMITIVE, "12")); |
|||
check(parse("{\"a\": 0, \"b\": \"c\"}", 5, 5, |
|||
JSMN_OBJECT, -1, -1, 2, |
|||
JSMN_STRING, "a", 1, |
|||
JSMN_PRIMITIVE, "0", |
|||
JSMN_STRING, "b", 1, |
|||
JSMN_STRING, "c", 0)); |
|||
|
|||
#ifdef JSMN_STRICT |
|||
check(parse("{\"a\"\n0}", JSMN_ERROR_INVAL, 3)); |
|||
check(parse("{\"a\", 0}", JSMN_ERROR_INVAL, 3)); |
|||
check(parse("{\"a\": {2}}", JSMN_ERROR_INVAL, 3)); |
|||
check(parse("{\"a\": {2: 3}}", JSMN_ERROR_INVAL, 3)); |
|||
check(parse("{\"a\": {\"a\": 2 3}}", JSMN_ERROR_INVAL, 5)); |
|||
/* FIXME */ |
|||
/*check(parse("{\"a\"}", JSMN_ERROR_INVAL, 2));*/ |
|||
/*check(parse("{\"a\": 1, \"b\"}", JSMN_ERROR_INVAL, 4));*/ |
|||
/*check(parse("{\"a\",\"b\":1}", JSMN_ERROR_INVAL, 4));*/ |
|||
/*check(parse("{\"a\":1,}", JSMN_ERROR_INVAL, 4));*/ |
|||
/*check(parse("{\"a\":\"b\":\"c\"}", JSMN_ERROR_INVAL, 4));*/ |
|||
/*check(parse("{,}", JSMN_ERROR_INVAL, 4));*/ |
|||
#endif |
|||
return 0; |
|||
} |
|||
|
|||
int test_array(void) { |
|||
/* FIXME */ |
|||
/*check(parse("[10}", JSMN_ERROR_INVAL, 3));*/ |
|||
/*check(parse("[1,,3]", JSMN_ERROR_INVAL, 3)*/ |
|||
check(parse("[10]", 2, 2, |
|||
JSMN_ARRAY, -1, -1, 1, |
|||
JSMN_PRIMITIVE, "10")); |
|||
check(parse("{\"a\": 1]", JSMN_ERROR_INVAL, 3)); |
|||
/* FIXME */ |
|||
/*check(parse("[\"a\": 1]", JSMN_ERROR_INVAL, 3));*/ |
|||
return 0; |
|||
} |
|||
|
|||
int test_primitive(void) { |
|||
check(parse("{\"boolVar\" : true }", 3, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "boolVar", 1, |
|||
JSMN_PRIMITIVE, "true")); |
|||
check(parse("{\"boolVar\" : false }", 3, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "boolVar", 1, |
|||
JSMN_PRIMITIVE, "false")); |
|||
check(parse("{\"nullVar\" : null }", 3, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "nullVar", 1, |
|||
JSMN_PRIMITIVE, "null")); |
|||
check(parse("{\"intVar\" : 12}", 3, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "intVar", 1, |
|||
JSMN_PRIMITIVE, "12")); |
|||
check(parse("{\"floatVar\" : 12.345}", 3, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "floatVar", 1, |
|||
JSMN_PRIMITIVE, "12.345")); |
|||
return 0; |
|||
} |
|||
|
|||
int test_string(void) { |
|||
check(parse("{\"strVar\" : \"hello world\"}", 3, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "strVar", 1, |
|||
JSMN_STRING, "hello world", 0)); |
|||
check(parse("{\"strVar\" : \"escapes: \\/\\r\\n\\t\\b\\f\\\"\\\\\"}", 3, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "strVar", 1, |
|||
JSMN_STRING, "escapes: \\/\\r\\n\\t\\b\\f\\\"\\\\", 0)); |
|||
check(parse("{\"strVar\": \"\"}", 3, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "strVar", 1, |
|||
JSMN_STRING, "", 0)); |
|||
check(parse("{\"a\":\"\\uAbcD\"}", 3, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "a", 1, |
|||
JSMN_STRING, "\\uAbcD", 0)); |
|||
check(parse("{\"a\":\"str\\u0000\"}", 3, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "a", 1, |
|||
JSMN_STRING, "str\\u0000", 0)); |
|||
check(parse("{\"a\":\"\\uFFFFstr\"}", 3, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "a", 1, |
|||
JSMN_STRING, "\\uFFFFstr", 0)); |
|||
check(parse("{\"a\":[\"\\u0280\"]}", 4, 4, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "a", 1, |
|||
JSMN_ARRAY, -1, -1, 1, |
|||
JSMN_STRING, "\\u0280", 0)); |
|||
|
|||
check(parse("{\"a\":\"str\\uFFGFstr\"}", JSMN_ERROR_INVAL, 3)); |
|||
check(parse("{\"a\":\"str\\u@FfF\"}", JSMN_ERROR_INVAL, 3)); |
|||
check(parse("{{\"a\":[\"\\u028\"]}", JSMN_ERROR_INVAL, 4)); |
|||
return 0; |
|||
} |
|||
|
|||
int test_partial_string(void) { |
|||
int i; |
|||
int r; |
|||
jsmn_parser p; |
|||
jsmntok_t tok[5]; |
|||
const char *js = "{\"x\": \"va\\\\ue\", \"y\": \"value y\"}"; |
|||
|
|||
jsmn_init(&p); |
|||
for (i = 1; i <= strlen(js); i++) { |
|||
r = jsmn_parse(&p, js, i, tok, sizeof(tok)/sizeof(tok[0])); |
|||
if (i == strlen(js)) { |
|||
check(r == 5); |
|||
check(tokeq(js, tok, 5, |
|||
JSMN_OBJECT, -1, -1, 2, |
|||
JSMN_STRING, "x", 1, |
|||
JSMN_STRING, "va\\\\ue", 0, |
|||
JSMN_STRING, "y", 1, |
|||
JSMN_STRING, "value y", 0)); |
|||
} else { |
|||
check(r == JSMN_ERROR_PART); |
|||
} |
|||
} |
|||
return 0; |
|||
} |
|||
|
|||
int test_partial_array(void) { |
|||
#ifdef JSMN_STRICT |
|||
int r; |
|||
int i; |
|||
jsmn_parser p; |
|||
jsmntok_t tok[10]; |
|||
const char *js = "[ 1, true, [123, \"hello\"]]"; |
|||
|
|||
jsmn_init(&p); |
|||
for (i = 1; i <= strlen(js); i++) { |
|||
r = jsmn_parse(&p, js, i, tok, sizeof(tok)/sizeof(tok[0])); |
|||
if (i == strlen(js)) { |
|||
check(r == 6); |
|||
check(tokeq(js, tok, 6, |
|||
JSMN_ARRAY, -1, -1, 3, |
|||
JSMN_PRIMITIVE, "1", |
|||
JSMN_PRIMITIVE, "true", |
|||
JSMN_ARRAY, -1, -1, 2, |
|||
JSMN_PRIMITIVE, "123", |
|||
JSMN_STRING, "hello", 0)); |
|||
} else { |
|||
check(r == JSMN_ERROR_PART); |
|||
} |
|||
} |
|||
#endif |
|||
return 0; |
|||
} |
|||
|
|||
int test_array_nomem(void) { |
|||
int i; |
|||
int r; |
|||
jsmn_parser p; |
|||
jsmntok_t toksmall[10], toklarge[10]; |
|||
const char *js; |
|||
|
|||
js = " [ 1, true, [123, \"hello\"]]"; |
|||
|
|||
for (i = 0; i < 6; i++) { |
|||
jsmn_init(&p); |
|||
memset(toksmall, 0, sizeof(toksmall)); |
|||
memset(toklarge, 0, sizeof(toklarge)); |
|||
r = jsmn_parse(&p, js, strlen(js), toksmall, i); |
|||
check(r == JSMN_ERROR_NOMEM); |
|||
|
|||
memcpy(toklarge, toksmall, sizeof(toksmall)); |
|||
|
|||
r = jsmn_parse(&p, js, strlen(js), toklarge, 10); |
|||
check(r >= 0); |
|||
check(tokeq(js, toklarge, 4, |
|||
JSMN_ARRAY, -1, -1, 3, |
|||
JSMN_PRIMITIVE, "1", |
|||
JSMN_PRIMITIVE, "true", |
|||
JSMN_ARRAY, -1, -1, 2, |
|||
JSMN_PRIMITIVE, "123", |
|||
JSMN_STRING, "hello", 0)); |
|||
} |
|||
return 0; |
|||
} |
|||
|
|||
int test_unquoted_keys(void) { |
|||
#ifndef JSMN_STRICT |
|||
int r; |
|||
jsmn_parser p; |
|||
jsmntok_t tok[10]; |
|||
const char *js; |
|||
|
|||
jsmn_init(&p); |
|||
js = "key1: \"value\"\nkey2 : 123"; |
|||
|
|||
r = jsmn_parse(&p, js, strlen(js), tok, 10); |
|||
check(r >= 0); |
|||
check(tokeq(js, tok, 4, |
|||
JSMN_PRIMITIVE, "key1", |
|||
JSMN_STRING, "value", 0, |
|||
JSMN_PRIMITIVE, "key2", |
|||
JSMN_PRIMITIVE, "123")); |
|||
#endif |
|||
return 0; |
|||
} |
|||
|
|||
int test_issue_22(void) { |
|||
int r; |
|||
jsmn_parser p; |
|||
jsmntok_t tokens[128]; |
|||
const char *js; |
|||
|
|||
js = "{ \"height\":10, \"layers\":[ { \"data\":[6,6], \"height\":10, " |
|||
"\"name\":\"Calque de Tile 1\", \"opacity\":1, \"type\":\"tilelayer\", " |
|||
"\"visible\":true, \"width\":10, \"x\":0, \"y\":0 }], " |
|||
"\"orientation\":\"orthogonal\", \"properties\": { }, \"tileheight\":32, " |
|||
"\"tilesets\":[ { \"firstgid\":1, \"image\":\"..\\/images\\/tiles.png\", " |
|||
"\"imageheight\":64, \"imagewidth\":160, \"margin\":0, \"name\":\"Tiles\", " |
|||
"\"properties\":{}, \"spacing\":0, \"tileheight\":32, \"tilewidth\":32 }], " |
|||
"\"tilewidth\":32, \"version\":1, \"width\":10 }"; |
|||
jsmn_init(&p); |
|||
r = jsmn_parse(&p, js, strlen(js), tokens, 128); |
|||
check(r >= 0); |
|||
return 0; |
|||
} |
|||
|
|||
int test_issue_27(void) { |
|||
const char *js = |
|||
"{ \"name\" : \"Jack\", \"age\" : 27 } { \"name\" : \"Anna\", "; |
|||
check(parse(js, JSMN_ERROR_PART, 8)); |
|||
return 0; |
|||
} |
|||
|
|||
int test_input_length(void) { |
|||
const char *js; |
|||
int r; |
|||
jsmn_parser p; |
|||
jsmntok_t tokens[10]; |
|||
|
|||
js = "{\"a\": 0}garbage"; |
|||
|
|||
jsmn_init(&p); |
|||
r = jsmn_parse(&p, js, 8, tokens, 10); |
|||
check(r == 3); |
|||
check(tokeq(js, tokens, 3, |
|||
JSMN_OBJECT, -1, -1, 1, |
|||
JSMN_STRING, "a", 1, |
|||
JSMN_PRIMITIVE, "0")); |
|||
return 0; |
|||
} |
|||
|
|||
int test_count(void) { |
|||
jsmn_parser p; |
|||
const char *js; |
|||
|
|||
js = "{}"; |
|||
jsmn_init(&p); |
|||
check(jsmn_parse(&p, js, strlen(js), NULL, 0) == 1); |
|||
|
|||
js = "[]"; |
|||
jsmn_init(&p); |
|||
check(jsmn_parse(&p, js, strlen(js), NULL, 0) == 1); |
|||
|
|||
js = "[[]]"; |
|||
jsmn_init(&p); |
|||
check(jsmn_parse(&p, js, strlen(js), NULL, 0) == 2); |
|||
|
|||
js = "[[], []]"; |
|||
jsmn_init(&p); |
|||
check(jsmn_parse(&p, js, strlen(js), NULL, 0) == 3); |
|||
|
|||
js = "[[], []]"; |
|||
jsmn_init(&p); |
|||
check(jsmn_parse(&p, js, strlen(js), NULL, 0) == 3); |
|||
|
|||
js = "[[], [[]], [[], []]]"; |
|||
jsmn_init(&p); |
|||
check(jsmn_parse(&p, js, strlen(js), NULL, 0) == 7); |
|||
|
|||
js = "[\"a\", [[], []]]"; |
|||
jsmn_init(&p); |
|||
check(jsmn_parse(&p, js, strlen(js), NULL, 0) == 5); |
|||
|
|||
js = "[[], \"[], [[]]\", [[]]]"; |
|||
jsmn_init(&p); |
|||
check(jsmn_parse(&p, js, strlen(js), NULL, 0) == 5); |
|||
|
|||
js = "[1, 2, 3]"; |
|||
jsmn_init(&p); |
|||
check(jsmn_parse(&p, js, strlen(js), NULL, 0) == 4); |
|||
|
|||
js = "[1, 2, [3, \"a\"], null]"; |
|||
jsmn_init(&p); |
|||
check(jsmn_parse(&p, js, strlen(js), NULL, 0) == 7); |
|||
|
|||
return 0; |
|||
} |
|||
|
|||
|
|||
int test_nonstrict(void) { |
|||
#ifndef JSMN_STRICT |
|||
const char *js; |
|||
js = "a: 0garbage"; |
|||
check(parse(js, 2, 2, |
|||
JSMN_PRIMITIVE, "a", |
|||
JSMN_PRIMITIVE, "0garbage")); |
|||
|
|||
js = "Day : 26\nMonth : Sep\n\nYear: 12"; |
|||
check(parse(js, 6, 6, |
|||
JSMN_PRIMITIVE, "Day", |
|||
JSMN_PRIMITIVE, "26", |
|||
JSMN_PRIMITIVE, "Month", |
|||
JSMN_PRIMITIVE, "Sep", |
|||
JSMN_PRIMITIVE, "Year", |
|||
JSMN_PRIMITIVE, "12")); |
|||
|
|||
//nested {s don't cause a parse error.
|
|||
js = "\"key {1\": 1234"; |
|||
check(parse(js, 2, 2, |
|||
JSMN_STRING, "key {1", 1, |
|||
JSMN_PRIMITIVE, "1234")); |
|||
|
|||
|
|||
#endif |
|||
return 0; |
|||
} |
|||
|
|||
int test_unmatched_brackets(void) { |
|||
const char *js; |
|||
js = "\"key 1\": 1234}"; |
|||
check(parse(js, JSMN_ERROR_INVAL, 2)); |
|||
js = "{\"key 1\": 1234"; |
|||
check(parse(js, JSMN_ERROR_PART, 3)); |
|||
js = "{\"key 1\": 1234}}"; |
|||
check(parse(js, JSMN_ERROR_INVAL, 3)); |
|||
js = "\"key 1\"}: 1234"; |
|||
check(parse(js, JSMN_ERROR_INVAL, 3)); |
|||
js = "{\"key {1\": 1234}"; |
|||
check(parse(js, 3, 3, |
|||
JSMN_OBJECT, 0, 16, 1, |
|||
JSMN_STRING, "key {1", 1, |
|||
JSMN_PRIMITIVE, "1234")); |
|||
js = "{{\"key 1\": 1234}"; |
|||
check(parse(js, JSMN_ERROR_PART, 4)); |
|||
return 0; |
|||
} |
|||
|
|||
int main(void) { |
|||
test(test_empty, "test for a empty JSON objects/arrays"); |
|||
test(test_object, "test for a JSON objects"); |
|||
test(test_array, "test for a JSON arrays"); |
|||
test(test_primitive, "test primitive JSON data types"); |
|||
test(test_string, "test string JSON data types"); |
|||
|
|||
test(test_partial_string, "test partial JSON string parsing"); |
|||
test(test_partial_array, "test partial array reading"); |
|||
test(test_array_nomem, "test array reading with a smaller number of tokens"); |
|||
test(test_unquoted_keys, "test unquoted keys (like in JavaScript)"); |
|||
test(test_input_length, "test strings that are not null-terminated"); |
|||
test(test_issue_22, "test issue #22"); |
|||
test(test_issue_27, "test issue #27"); |
|||
test(test_count, "test tokens count estimation"); |
|||
test(test_nonstrict, "test for non-strict mode"); |
|||
test(test_unmatched_brackets, "test for unmatched brackets"); |
|||
printf("\nPASSED: %d\nFAILED: %d\n", test_passed, test_failed); |
|||
return (test_failed > 0); |
|||
} |
@ -0,0 +1,94 @@ |
|||
#ifndef __TEST_UTIL_H__ |
|||
#define __TEST_UTIL_H__ |
|||
|
|||
#include "../jsmn.c" |
|||
|
|||
static int vtokeq(const char *s, jsmntok_t *t, int numtok, va_list ap) { |
|||
if (numtok > 0) { |
|||
int i, start, end, size; |
|||
int type; |
|||
char *value; |
|||
|
|||
size = -1; |
|||
value = NULL; |
|||
for (i = 0; i < numtok; i++) { |
|||
type = va_arg(ap, int); |
|||
if (type == JSMN_STRING) { |
|||
value = va_arg(ap, char *); |
|||
size = va_arg(ap, int); |
|||
start = end = -1; |
|||
} else if (type == JSMN_PRIMITIVE) { |
|||
value = va_arg(ap, char *); |
|||
start = end = size = -1; |
|||
} else { |
|||
start = va_arg(ap, int); |
|||
end = va_arg(ap, int); |
|||
size = va_arg(ap, int); |
|||
value = NULL; |
|||
} |
|||
if (t[i].type != type) { |
|||
printf("token %d type is %d, not %d\n", i, t[i].type, type); |
|||
return 0; |
|||
} |
|||
if (start != -1 && end != -1) { |
|||
if (t[i].start != start) { |
|||
printf("token %d start is %d, not %d\n", i, t[i].start, start); |
|||
return 0; |
|||
} |
|||
if (t[i].end != end ) { |
|||
printf("token %d end is %d, not %d\n", i, t[i].end, end); |
|||
return 0; |
|||
} |
|||
} |
|||
if (size != -1 && t[i].size != size) { |
|||
printf("token %d size is %d, not %d\n", i, t[i].size, size); |
|||
return 0; |
|||
} |
|||
|
|||
if (s != NULL && value != NULL) { |
|||
const char *p = s + t[i].start; |
|||
if (strlen(value) != t[i].end - t[i].start || |
|||
strncmp(p, value, t[i].end - t[i].start) != 0) { |
|||
printf("token %d value is %.*s, not %s\n", i, t[i].end-t[i].start, |
|||
s+t[i].start, value); |
|||
return 0; |
|||
} |
|||
} |
|||
} |
|||
} |
|||
return 1; |
|||
} |
|||
|
|||
static int tokeq(const char *s, jsmntok_t *tokens, int numtok, ...) { |
|||
int ok; |
|||
va_list args; |
|||
va_start(args, numtok); |
|||
ok = vtokeq(s, tokens, numtok, args); |
|||
va_end(args); |
|||
return ok; |
|||
} |
|||
|
|||
static int parse(const char *s, int status, int numtok, ...) { |
|||
int r; |
|||
int ok = 1; |
|||
va_list args; |
|||
jsmn_parser p; |
|||
jsmntok_t *t = malloc(numtok * sizeof(jsmntok_t)); |
|||
|
|||
jsmn_init(&p); |
|||
r = jsmn_parse(&p, s, strlen(s), t, numtok); |
|||
if (r != status) { |
|||
printf("status is %d, not %d\n", r, status); |
|||
return 0; |
|||
} |
|||
|
|||
if (status >= 0) { |
|||
va_start(args, numtok); |
|||
ok = vtokeq(s, t, numtok, args); |
|||
va_end(args); |
|||
} |
|||
free(t); |
|||
return ok; |
|||
} |
|||
|
|||
#endif /* __TEST_UTIL_H__ */ |
@ -0,0 +1,5 @@ |
|||
*~ |
|||
*.o |
|||
*.lo |
|||
*.a |
|||
*.la |
@ -0,0 +1,29 @@ |
|||
# Copyright (C) 2012-2016 Free Software Foundation, Inc. |
|||
|
|||
# Redistribution and use in source and binary forms, with or without |
|||
# modification, are permitted provided that the following conditions are |
|||
# met: |
|||
|
|||
# (1) Redistributions of source code must retain the above copyright |
|||
# notice, this list of conditions and the following disclaimer. |
|||
|
|||
# (2) Redistributions in binary form must reproduce the above copyright |
|||
# notice, this list of conditions and the following disclaimer in |
|||
# the documentation and/or other materials provided with the |
|||
# distribution. |
|||
|
|||
# (3) The name of the author may not be used to |
|||
# endorse or promote products derived from this software without |
|||
# specific prior written permission. |
|||
|
|||
# THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
# IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
# DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
# INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
# STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
# IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
# POSSIBILITY OF SUCH DAMAGE. |
@ -0,0 +1,206 @@ |
|||
# Makefile.am -- Backtrace Makefile.
|
|||
# Copyright (C) 2012-2018 Free Software Foundation, Inc.
|
|||
|
|||
# Redistribution and use in source and binary forms, with or without
|
|||
# modification, are permitted provided that the following conditions are
|
|||
# met:
|
|||
|
|||
# (1) Redistributions of source code must retain the above copyright
|
|||
# notice, this list of conditions and the following disclaimer.
|
|||
|
|||
# (2) Redistributions in binary form must reproduce the above copyright
|
|||
# notice, this list of conditions and the following disclaimer in
|
|||
# the documentation and/or other materials provided with the
|
|||
# distribution.
|
|||
|
|||
# (3) The name of the author may not be used to
|
|||
# endorse or promote products derived from this software without
|
|||
# specific prior written permission.
|
|||
|
|||
# THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|||
# IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|||
# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|||
# DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
|
|||
# INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|||
# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|||
# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|||
# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|||
# STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
|||
# IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|||
# POSSIBILITY OF SUCH DAMAGE.
|
|||
|
|||
ACLOCAL_AMFLAGS = -I config |
|||
|
|||
AM_CFLAGS = $(EXTRA_FLAGS) $(WARN_FLAGS) $(PIC_FLAG) |
|||
|
|||
include_HEADERS = backtrace.h backtrace-supported.h |
|||
|
|||
lib_LTLIBRARIES = libbacktrace.la |
|||
|
|||
libbacktrace_la_SOURCES = \
|
|||
backtrace.h \
|
|||
atomic.c \
|
|||
dwarf.c \
|
|||
fileline.c \
|
|||
internal.h \
|
|||
posix.c \
|
|||
print.c \
|
|||
sort.c \
|
|||
state.c |
|||
|
|||
BACKTRACE_FILES = \
|
|||
backtrace.c \
|
|||
simple.c \
|
|||
nounwind.c |
|||
|
|||
FORMAT_FILES = \
|
|||
elf.c \
|
|||
pecoff.c \
|
|||
unknown.c \
|
|||
xcoff.c |
|||
|
|||
VIEW_FILES = \
|
|||
read.c \
|
|||
mmapio.c |
|||
|
|||
ALLOC_FILES = \
|
|||
alloc.c \
|
|||
mmap.c |
|||
|
|||
EXTRA_libbacktrace_la_SOURCES = \
|
|||
$(BACKTRACE_FILES) \
|
|||
$(FORMAT_FILES) \
|
|||
$(VIEW_FILES) \
|
|||
$(ALLOC_FILES) |
|||
|
|||
libbacktrace_la_LIBADD = \
|
|||
$(BACKTRACE_FILE) \
|
|||
$(FORMAT_FILE) \
|
|||
$(VIEW_FILE) \
|
|||
$(ALLOC_FILE) |
|||
|
|||
libbacktrace_la_DEPENDENCIES = $(libbacktrace_la_LIBADD) |
|||
|
|||
# Testsuite.
|
|||
|
|||
check_PROGRAMS = |
|||
CLEANFILES = |
|||
|
|||
TESTS = $(check_PROGRAMS) |
|||
|
|||
if NATIVE |
|||
|
|||
btest_SOURCES = btest.c testlib.c |
|||
btest_CFLAGS = $(AM_CFLAGS) -g -O |
|||
btest_LDADD = libbacktrace.la |
|||
|
|||
check_PROGRAMS += btest |
|||
|
|||
btest_static_SOURCES = btest.c testlib.c |
|||
btest_static_CFLAGS = $(AM_CFLAGS) -g -O |
|||
btest_static_LDADD = libbacktrace.la |
|||
btest_static_LDFLAGS = -static-libtool-libs |
|||
|
|||
check_PROGRAMS += btest_static |
|||
|
|||
stest_SOURCES = stest.c |
|||
stest_LDADD = libbacktrace.la |
|||
|
|||
check_PROGRAMS += stest |
|||
|
|||
ztest_SOURCES = ztest.c testlib.c |
|||
ztest_CFLAGS = -DSRCDIR=\"$(srcdir)\" |
|||
ztest_LDADD = libbacktrace.la |
|||
|
|||
if HAVE_ZLIB |
|||
ztest_LDADD += -lz |
|||
endif |
|||
ztest_LDADD += $(CLOCK_GETTIME_LINK) |
|||
|
|||
check_PROGRAMS += ztest |
|||
|
|||
edtest_SOURCES = edtest.c edtest2_build.c testlib.c |
|||
edtest_LDADD = libbacktrace.la |
|||
|
|||
check_PROGRAMS += edtest |
|||
|
|||
edtest2_build.c: gen_edtest2_build; @true |
|||
gen_edtest2_build: $(srcdir)/edtest2.c |
|||
cat $(srcdir)/edtest2.c > tmp-edtest2_build.c |
|||
$(SHELL) $(srcdir)/move-if-change tmp-edtest2_build.c edtest2_build.c |
|||
echo timestamp > $@ |
|||
|
|||
CLEANFILES += edtest2_build.c gen_edtest2_build |
|||
|
|||
if HAVE_PTHREAD |
|||
|
|||
check_PROGRAMS += ttest |
|||
|
|||
ttest_SOURCES = ttest.c testlib.c |
|||
ttest_CFLAGS = $(AM_CFLAGS) -pthread |
|||
ttest_LDADD = libbacktrace.la |
|||
|
|||
endif HAVE_PTHREAD |
|||
|
|||
if HAVE_OBJCOPY_DEBUGLINK |
|||
|
|||
TESTS += dtest |
|||
|
|||
dtest: btest_static |
|||
$(OBJCOPY) --only-keep-debug btest_static btest.debug |
|||
$(OBJCOPY) --strip-debug --add-gnu-debuglink=btest.debug btest_static dtest |
|||
|
|||
CLEANFILES += dtest btest.debug |
|||
|
|||
endif HAVE_OBJCOPY_DEBUGLINK |
|||
|
|||
if HAVE_COMPRESSED_DEBUG |
|||
|
|||
ctestg_SOURCES = btest.c testlib.c |
|||
ctestg_CFLAGS = $(AM_CFLAGS) -g |
|||
ctestg_LDFLAGS = -Wl,--compress-debug-sections=zlib-gnu |
|||
ctestg_LDADD = libbacktrace.la |
|||
|
|||
ctesta_SOURCES = btest.c testlib.c |
|||
ctesta_CFLAGS = $(AM_CFLAGS) -g |
|||
ctesta_LDFLAGS = -Wl,--compress-debug-sections=zlib-gabi |
|||
ctesta_LDADD = libbacktrace.la |
|||
|
|||
check_PROGRAMS += ctestg ctesta |
|||
|
|||
endif |
|||
|
|||
endif NATIVE |
|||
|
|||
# We can't use automake's automatic dependency tracking, because it
|
|||
# breaks when using bootstrap-lean. Automatic dependency tracking
|
|||
# with GCC bootstrap will cause some of the objects to depend on
|
|||
# header files in prev-gcc/include, e.g., stddef.h and stdarg.h. When
|
|||
# using bootstrap-lean, prev-gcc is removed after each stage. When
|
|||
# running "make install", those header files will be gone, causing the
|
|||
# library to be rebuilt at install time. That may not succeed.
|
|||
|
|||
# These manual dependencies do not include dependencies on unwind.h,
|
|||
# even though that is part of GCC, because where to find it depends on
|
|||
# whether we are being built as a host library or a target library.
|
|||
|
|||
alloc.lo: config.h backtrace.h internal.h |
|||
backtrace.lo: config.h backtrace.h internal.h |
|||
btest.lo: backtrace.h backtrace-supported.h filenames.h |
|||
dwarf.lo: config.h filenames.h backtrace.h internal.h |
|||
elf.lo: config.h backtrace.h internal.h |
|||
fileline.lo: config.h backtrace.h internal.h |
|||
mmap.lo: config.h backtrace.h internal.h |
|||
mmapio.lo: config.h backtrace.h internal.h |
|||
nounwind.lo: config.h internal.h |
|||
pecoff.lo: config.h backtrace.h internal.h |
|||
posix.lo: config.h backtrace.h internal.h |
|||
print.lo: config.h backtrace.h internal.h |
|||
read.lo: config.h backtrace.h internal.h |
|||
simple.lo: config.h backtrace.h internal.h |
|||
sort.lo: config.h backtrace.h internal.h |
|||
stest.lo: config.h backtrace.h internal.h |
|||
state.lo: config.h backtrace.h backtrace-supported.h internal.h |
|||
unknown.lo: config.h backtrace.h internal.h |
|||
xcoff.lo: config.h backtrace.h internal.h |
|||
|
File diff suppressed because it is too large
File diff suppressed because it is too large
@ -0,0 +1,33 @@ |
|||
# libbacktrace |
|||
A C library that may be linked into a C/C++ program to produce symbolic backtraces |
|||
|
|||
Initially written by Ian Lance Taylor <iant@golang.org>. |
|||
|
|||
This is version 1.0. |
|||
It is likely that this will always be version 1.0. |
|||
|
|||
The libbacktrace library may be linked into a program or library and |
|||
used to produce symbolic backtraces. |
|||
Sample uses would be to print a detailed backtrace when an error |
|||
occurs or to gather detailed profiling information. |
|||
|
|||
The libbacktrace library is provided under a BSD license. |
|||
See the source files for the exact license text. |
|||
|
|||
The public functions are declared and documented in the header file |
|||
backtrace.h, which should be #include'd by a user of the library. |
|||
|
|||
Building libbacktrace will generate a file backtrace-supported.h, |
|||
which a user of the library may use to determine whether backtraces |
|||
will work. |
|||
See the source file backtrace-supported.h.in for the macros that it |
|||
defines. |
|||
|
|||
As of January 2018, libbacktrace only supports ELF, PE/COFF, and XCOFF |
|||
executables with DWARF debugging information. |
|||
The library is written to make it straightforward to add support for |
|||
other object file and debugging formats. |
|||
|
|||
The library relies on the C++ unwind API defined at |
|||
https://itanium-cxx-abi.github.io/cxx-abi/abi-eh.html |
|||
This API is provided by GCC. |
@ -0,0 +1,72 @@ |
|||
dnl |
|||
dnl Check whether _Unwind_GetIPInfo is available without doing a link |
|||
dnl test so we can use this with libstdc++-v3 and libjava. Need to |
|||
dnl use $target to set defaults because automatic checking is not possible |
|||
dnl without a link test (and maybe even with a link test). |
|||
dnl |
|||
|
|||
AC_DEFUN([GCC_CHECK_UNWIND_GETIPINFO], [ |
|||
AC_ARG_WITH(system-libunwind, |
|||
[ --with-system-libunwind use installed libunwind]) |
|||
# If system-libunwind was not specifically set, pick a default setting. |
|||
if test x$with_system_libunwind = x; then |
|||
case ${target} in |
|||
ia64-*-hpux*) with_system_libunwind=yes ;; |
|||
*) with_system_libunwind=no ;; |
|||
esac |
|||
fi |
|||
# Based on system-libunwind and target, do we have ipinfo? |
|||
if test x$with_system_libunwind = xyes; then |
|||
case ${target} in |
|||
ia64-*-*) have_unwind_getipinfo=no ;; |
|||
*) have_unwind_getipinfo=yes ;; |
|||
esac |
|||
else |
|||
# Darwin before version 9 does not have _Unwind_GetIPInfo. |
|||
changequote(,) |
|||
case ${target} in |
|||
*-*-darwin[3-8]|*-*-darwin[3-8].*) have_unwind_getipinfo=no ;; |
|||
*) have_unwind_getipinfo=yes ;; |
|||
esac |
|||
changequote([,]) |
|||
fi |
|||
|
|||
if test x$have_unwind_getipinfo = xyes; then |
|||
AC_DEFINE(HAVE_GETIPINFO, 1, [Define if _Unwind_GetIPInfo is available.]) |
|||
fi |
|||
]) |
|||
|
|||
# ACX_PROG_CC_WARNING_OPTS(WARNINGS, [VARIABLE = WARN_CFLAGS]) |
|||
# Sets @VARIABLE@ to the subset of the given options which the |
|||
# compiler accepts. |
|||
AC_DEFUN([ACX_PROG_CC_WARNING_OPTS], |
|||
[AC_REQUIRE([AC_PROG_CC])dnl |
|||
AC_LANG_PUSH(C) |
|||
m4_pushdef([acx_Var], [m4_default([$2], [WARN_CFLAGS])])dnl |
|||
AC_SUBST(acx_Var)dnl |
|||
m4_expand_once([acx_Var= |
|||
],m4_quote(acx_Var=))dnl |
|||
save_CFLAGS="$CFLAGS" |
|||
for real_option in $1; do |
|||
# Do the check with the no- prefix removed since gcc silently |
|||
# accepts any -Wno-* option on purpose |
|||
case $real_option in |
|||
-Wno-*) option=-W`expr x$real_option : 'x-Wno-\(.*\)'` ;; |
|||
*) option=$real_option ;; |
|||
esac |
|||
AS_VAR_PUSHDEF([acx_Woption], [acx_cv_prog_cc_warning_$option]) |
|||
AC_CACHE_CHECK([whether $CC supports $option], acx_Woption, |
|||
[CFLAGS="$option" |
|||
AC_COMPILE_IFELSE([AC_LANG_PROGRAM([],[])], |
|||
[AS_VAR_SET(acx_Woption, yes)], |
|||
[AS_VAR_SET(acx_Woption, no)]) |
|||
]) |
|||
AS_IF([test AS_VAR_GET(acx_Woption) = yes], |
|||
[acx_Var="$acx_Var${acx_Var:+ }$real_option"]) |
|||
AS_VAR_POPDEF([acx_Woption])dnl |
|||
done |
|||
CFLAGS="$save_CFLAGS" |
|||
m4_popdef([acx_Var])dnl |
|||
AC_LANG_POP(C) |
|||
])# ACX_PROG_CC_WARNING_OPTS |
|||
|
@ -0,0 +1,767 @@ |
|||
# generated automatically by aclocal 1.11.6 -*- Autoconf -*- |
|||
|
|||
# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, |
|||
# 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software Foundation, |
|||
# Inc. |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# This program is distributed in the hope that it will be useful, |
|||
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without |
|||
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A |
|||
# PARTICULAR PURPOSE. |
|||
|
|||
m4_ifndef([AC_AUTOCONF_VERSION], |
|||
[m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl |
|||
m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.64],, |
|||
[m4_warning([this file was generated for autoconf 2.64. |
|||
You have another version of autoconf. It may work, but is not guaranteed to. |
|||
If you have problems, you may need to regenerate the build system entirely. |
|||
To do so, use the procedure documented by the package, typically `autoreconf'.])]) |
|||
|
|||
# Copyright (C) 2002, 2003, 2005, 2006, 2007, 2008, 2011 Free Software |
|||
# Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 1 |
|||
|
|||
# AM_AUTOMAKE_VERSION(VERSION) |
|||
# ---------------------------- |
|||
# Automake X.Y traces this macro to ensure aclocal.m4 has been |
|||
# generated from the m4 files accompanying Automake X.Y. |
|||
# (This private macro should not be called outside this file.) |
|||
AC_DEFUN([AM_AUTOMAKE_VERSION], |
|||
[am__api_version='1.11' |
|||
dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to |
|||
dnl require some minimum version. Point them to the right macro. |
|||
m4_if([$1], [1.11.6], [], |
|||
[AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl |
|||
]) |
|||
|
|||
# _AM_AUTOCONF_VERSION(VERSION) |
|||
# ----------------------------- |
|||
# aclocal traces this macro to find the Autoconf version. |
|||
# This is a private macro too. Using m4_define simplifies |
|||
# the logic in aclocal, which can simply ignore this definition. |
|||
m4_define([_AM_AUTOCONF_VERSION], []) |
|||
|
|||
# AM_SET_CURRENT_AUTOMAKE_VERSION |
|||
# ------------------------------- |
|||
# Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced. |
|||
# This function is AC_REQUIREd by AM_INIT_AUTOMAKE. |
|||
AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], |
|||
[AM_AUTOMAKE_VERSION([1.11.6])dnl |
|||
m4_ifndef([AC_AUTOCONF_VERSION], |
|||
[m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl |
|||
_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))]) |
|||
|
|||
# AM_AUX_DIR_EXPAND -*- Autoconf -*- |
|||
|
|||
# Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 1 |
|||
|
|||
# For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets |
|||
# $ac_aux_dir to `$srcdir/foo'. In other projects, it is set to |
|||
# `$srcdir', `$srcdir/..', or `$srcdir/../..'. |
|||
# |
|||
# Of course, Automake must honor this variable whenever it calls a |
|||
# tool from the auxiliary directory. The problem is that $srcdir (and |
|||
# therefore $ac_aux_dir as well) can be either absolute or relative, |
|||
# depending on how configure is run. This is pretty annoying, since |
|||
# it makes $ac_aux_dir quite unusable in subdirectories: in the top |
|||
# source directory, any form will work fine, but in subdirectories a |
|||
# relative path needs to be adjusted first. |
|||
# |
|||
# $ac_aux_dir/missing |
|||
# fails when called from a subdirectory if $ac_aux_dir is relative |
|||
# $top_srcdir/$ac_aux_dir/missing |
|||
# fails if $ac_aux_dir is absolute, |
|||
# fails when called from a subdirectory in a VPATH build with |
|||
# a relative $ac_aux_dir |
|||
# |
|||
# The reason of the latter failure is that $top_srcdir and $ac_aux_dir |
|||
# are both prefixed by $srcdir. In an in-source build this is usually |
|||
# harmless because $srcdir is `.', but things will broke when you |
|||
# start a VPATH build or use an absolute $srcdir. |
|||
# |
|||
# So we could use something similar to $top_srcdir/$ac_aux_dir/missing, |
|||
# iff we strip the leading $srcdir from $ac_aux_dir. That would be: |
|||
# am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` |
|||
# and then we would define $MISSING as |
|||
# MISSING="\${SHELL} $am_aux_dir/missing" |
|||
# This will work as long as MISSING is not called from configure, because |
|||
# unfortunately $(top_srcdir) has no meaning in configure. |
|||
# However there are other variables, like CC, which are often used in |
|||
# configure, and could therefore not use this "fixed" $ac_aux_dir. |
|||
# |
|||
# Another solution, used here, is to always expand $ac_aux_dir to an |
|||
# absolute PATH. The drawback is that using absolute paths prevent a |
|||
# configured tree to be moved without reconfiguration. |
|||
|
|||
AC_DEFUN([AM_AUX_DIR_EXPAND], |
|||
[dnl Rely on autoconf to set up CDPATH properly. |
|||
AC_PREREQ([2.50])dnl |
|||
# expand $ac_aux_dir to an absolute path |
|||
am_aux_dir=`cd $ac_aux_dir && pwd` |
|||
]) |
|||
|
|||
# AM_CONDITIONAL -*- Autoconf -*- |
|||
|
|||
# Copyright (C) 1997, 2000, 2001, 2003, 2004, 2005, 2006, 2008 |
|||
# Free Software Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 9 |
|||
|
|||
# AM_CONDITIONAL(NAME, SHELL-CONDITION) |
|||
# ------------------------------------- |
|||
# Define a conditional. |
|||
AC_DEFUN([AM_CONDITIONAL], |
|||
[AC_PREREQ(2.52)dnl |
|||
ifelse([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], |
|||
[$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl |
|||
AC_SUBST([$1_TRUE])dnl |
|||
AC_SUBST([$1_FALSE])dnl |
|||
_AM_SUBST_NOTMAKE([$1_TRUE])dnl |
|||
_AM_SUBST_NOTMAKE([$1_FALSE])dnl |
|||
m4_define([_AM_COND_VALUE_$1], [$2])dnl |
|||
if $2; then |
|||
$1_TRUE= |
|||
$1_FALSE='#' |
|||
else |
|||
$1_TRUE='#' |
|||
$1_FALSE= |
|||
fi |
|||
AC_CONFIG_COMMANDS_PRE( |
|||
[if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then |
|||
AC_MSG_ERROR([[conditional "$1" was never defined. |
|||
Usually this means the macro was only invoked conditionally.]]) |
|||
fi])]) |
|||
|
|||
# Do all the work for Automake. -*- Autoconf -*- |
|||
|
|||
# Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, |
|||
# 2005, 2006, 2008, 2009 Free Software Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 16 |
|||
|
|||
# This macro actually does too much. Some checks are only needed if |
|||
# your package does certain things. But this isn't really a big deal. |
|||
|
|||
# AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) |
|||
# AM_INIT_AUTOMAKE([OPTIONS]) |
|||
# ----------------------------------------------- |
|||
# The call with PACKAGE and VERSION arguments is the old style |
|||
# call (pre autoconf-2.50), which is being phased out. PACKAGE |
|||
# and VERSION should now be passed to AC_INIT and removed from |
|||
# the call to AM_INIT_AUTOMAKE. |
|||
# We support both call styles for the transition. After |
|||
# the next Automake release, Autoconf can make the AC_INIT |
|||
# arguments mandatory, and then we can depend on a new Autoconf |
|||
# release and drop the old call support. |
|||
AC_DEFUN([AM_INIT_AUTOMAKE], |
|||
[AC_PREREQ([2.62])dnl |
|||
dnl Autoconf wants to disallow AM_ names. We explicitly allow |
|||
dnl the ones we care about. |
|||
m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl |
|||
AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl |
|||
AC_REQUIRE([AC_PROG_INSTALL])dnl |
|||
if test "`cd $srcdir && pwd`" != "`pwd`"; then |
|||
# Use -I$(srcdir) only when $(srcdir) != ., so that make's output |
|||
# is not polluted with repeated "-I." |
|||
AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl |
|||
# test to see if srcdir already configured |
|||
if test -f $srcdir/config.status; then |
|||
AC_MSG_ERROR([source directory already configured; run "make distclean" there first]) |
|||
fi |
|||
fi |
|||
|
|||
# test whether we have cygpath |
|||
if test -z "$CYGPATH_W"; then |
|||
if (cygpath --version) >/dev/null 2>/dev/null; then |
|||
CYGPATH_W='cygpath -w' |
|||
else |
|||
CYGPATH_W=echo |
|||
fi |
|||
fi |
|||
AC_SUBST([CYGPATH_W]) |
|||
|
|||
# Define the identity of the package. |
|||
dnl Distinguish between old-style and new-style calls. |
|||
m4_ifval([$2], |
|||
[m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl |
|||
AC_SUBST([PACKAGE], [$1])dnl |
|||
AC_SUBST([VERSION], [$2])], |
|||
[_AM_SET_OPTIONS([$1])dnl |
|||
dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT. |
|||
m4_if(m4_ifdef([AC_PACKAGE_NAME], 1)m4_ifdef([AC_PACKAGE_VERSION], 1), 11,, |
|||
[m4_fatal([AC_INIT should be called with package and version arguments])])dnl |
|||
AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl |
|||
AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl |
|||
|
|||
_AM_IF_OPTION([no-define],, |
|||
[AC_DEFINE_UNQUOTED(PACKAGE, "$PACKAGE", [Name of package]) |
|||
AC_DEFINE_UNQUOTED(VERSION, "$VERSION", [Version number of package])])dnl |
|||
|
|||
# Some tools Automake needs. |
|||
AC_REQUIRE([AM_SANITY_CHECK])dnl |
|||
AC_REQUIRE([AC_ARG_PROGRAM])dnl |
|||
AM_MISSING_PROG(ACLOCAL, aclocal-${am__api_version}) |
|||
AM_MISSING_PROG(AUTOCONF, autoconf) |
|||
AM_MISSING_PROG(AUTOMAKE, automake-${am__api_version}) |
|||
AM_MISSING_PROG(AUTOHEADER, autoheader) |
|||
AM_MISSING_PROG(MAKEINFO, makeinfo) |
|||
AC_REQUIRE([AM_PROG_INSTALL_SH])dnl |
|||
AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl |
|||
AC_REQUIRE([AM_PROG_MKDIR_P])dnl |
|||
# We need awk for the "check" target. The system "awk" is bad on |
|||
# some platforms. |
|||
AC_REQUIRE([AC_PROG_AWK])dnl |
|||
AC_REQUIRE([AC_PROG_MAKE_SET])dnl |
|||
AC_REQUIRE([AM_SET_LEADING_DOT])dnl |
|||
_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], |
|||
[_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], |
|||
[_AM_PROG_TAR([v7])])]) |
|||
_AM_IF_OPTION([no-dependencies],, |
|||
[AC_PROVIDE_IFELSE([AC_PROG_CC], |
|||
[_AM_DEPENDENCIES(CC)], |
|||
[define([AC_PROG_CC], |
|||
defn([AC_PROG_CC])[_AM_DEPENDENCIES(CC)])])dnl |
|||
AC_PROVIDE_IFELSE([AC_PROG_CXX], |
|||
[_AM_DEPENDENCIES(CXX)], |
|||
[define([AC_PROG_CXX], |
|||
defn([AC_PROG_CXX])[_AM_DEPENDENCIES(CXX)])])dnl |
|||
AC_PROVIDE_IFELSE([AC_PROG_OBJC], |
|||
[_AM_DEPENDENCIES(OBJC)], |
|||
[define([AC_PROG_OBJC], |
|||
defn([AC_PROG_OBJC])[_AM_DEPENDENCIES(OBJC)])])dnl |
|||
]) |
|||
_AM_IF_OPTION([silent-rules], [AC_REQUIRE([AM_SILENT_RULES])])dnl |
|||
dnl The `parallel-tests' driver may need to know about EXEEXT, so add the |
|||
dnl `am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This macro |
|||
dnl is hooked onto _AC_COMPILER_EXEEXT early, see below. |
|||
AC_CONFIG_COMMANDS_PRE(dnl |
|||
[m4_provide_if([_AM_COMPILER_EXEEXT], |
|||
[AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl |
|||
]) |
|||
|
|||
dnl Hook into `_AC_COMPILER_EXEEXT' early to learn its expansion. Do not |
|||
dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further |
|||
dnl mangled by Autoconf and run in a shell conditional statement. |
|||
m4_define([_AC_COMPILER_EXEEXT], |
|||
m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])]) |
|||
|
|||
|
|||
# When config.status generates a header, we must update the stamp-h file. |
|||
# This file resides in the same directory as the config header |
|||
# that is generated. The stamp files are numbered to have different names. |
|||
|
|||
# Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the |
|||
# loop where config.status creates the headers, so we can generate |
|||
# our stamp files there. |
|||
AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], |
|||
[# Compute $1's index in $config_headers. |
|||
_am_arg=$1 |
|||
_am_stamp_count=1 |
|||
for _am_header in $config_headers :; do |
|||
case $_am_header in |
|||
$_am_arg | $_am_arg:* ) |
|||
break ;; |
|||
* ) |
|||
_am_stamp_count=`expr $_am_stamp_count + 1` ;; |
|||
esac |
|||
done |
|||
echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count]) |
|||
|
|||
# Copyright (C) 2001, 2003, 2005, 2008, 2011 Free Software Foundation, |
|||
# Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 1 |
|||
|
|||
# AM_PROG_INSTALL_SH |
|||
# ------------------ |
|||
# Define $install_sh. |
|||
AC_DEFUN([AM_PROG_INSTALL_SH], |
|||
[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl |
|||
if test x"${install_sh}" != xset; then |
|||
case $am_aux_dir in |
|||
*\ * | *\ *) |
|||
install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; |
|||
*) |
|||
install_sh="\${SHELL} $am_aux_dir/install-sh" |
|||
esac |
|||
fi |
|||
AC_SUBST(install_sh)]) |
|||
|
|||
# Copyright (C) 2003, 2005 Free Software Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 2 |
|||
|
|||
# Check whether the underlying file-system supports filenames |
|||
# with a leading dot. For instance MS-DOS doesn't. |
|||
AC_DEFUN([AM_SET_LEADING_DOT], |
|||
[rm -rf .tst 2>/dev/null |
|||
mkdir .tst 2>/dev/null |
|||
if test -d .tst; then |
|||
am__leading_dot=. |
|||
else |
|||
am__leading_dot=_ |
|||
fi |
|||
rmdir .tst 2>/dev/null |
|||
AC_SUBST([am__leading_dot])]) |
|||
|
|||
# Add --enable-maintainer-mode option to configure. -*- Autoconf -*- |
|||
# From Jim Meyering |
|||
|
|||
# Copyright (C) 1996, 1998, 2000, 2001, 2002, 2003, 2004, 2005, 2008, |
|||
# 2011 Free Software Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 5 |
|||
|
|||
# AM_MAINTAINER_MODE([DEFAULT-MODE]) |
|||
# ---------------------------------- |
|||
# Control maintainer-specific portions of Makefiles. |
|||
# Default is to disable them, unless `enable' is passed literally. |
|||
# For symmetry, `disable' may be passed as well. Anyway, the user |
|||
# can override the default with the --enable/--disable switch. |
|||
AC_DEFUN([AM_MAINTAINER_MODE], |
|||
[m4_case(m4_default([$1], [disable]), |
|||
[enable], [m4_define([am_maintainer_other], [disable])], |
|||
[disable], [m4_define([am_maintainer_other], [enable])], |
|||
[m4_define([am_maintainer_other], [enable]) |
|||
m4_warn([syntax], [unexpected argument to AM@&t@_MAINTAINER_MODE: $1])]) |
|||
AC_MSG_CHECKING([whether to enable maintainer-specific portions of Makefiles]) |
|||
dnl maintainer-mode's default is 'disable' unless 'enable' is passed |
|||
AC_ARG_ENABLE([maintainer-mode], |
|||
[ --][am_maintainer_other][-maintainer-mode am_maintainer_other make rules and dependencies not useful |
|||
(and sometimes confusing) to the casual installer], |
|||
[USE_MAINTAINER_MODE=$enableval], |
|||
[USE_MAINTAINER_MODE=]m4_if(am_maintainer_other, [enable], [no], [yes])) |
|||
AC_MSG_RESULT([$USE_MAINTAINER_MODE]) |
|||
AM_CONDITIONAL([MAINTAINER_MODE], [test $USE_MAINTAINER_MODE = yes]) |
|||
MAINT=$MAINTAINER_MODE_TRUE |
|||
AC_SUBST([MAINT])dnl |
|||
] |
|||
) |
|||
|
|||
AU_DEFUN([jm_MAINTAINER_MODE], [AM_MAINTAINER_MODE]) |
|||
|
|||
# Fake the existence of programs that GNU maintainers use. -*- Autoconf -*- |
|||
|
|||
# Copyright (C) 1997, 1999, 2000, 2001, 2003, 2004, 2005, 2008 |
|||
# Free Software Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 6 |
|||
|
|||
# AM_MISSING_PROG(NAME, PROGRAM) |
|||
# ------------------------------ |
|||
AC_DEFUN([AM_MISSING_PROG], |
|||
[AC_REQUIRE([AM_MISSING_HAS_RUN]) |
|||
$1=${$1-"${am_missing_run}$2"} |
|||
AC_SUBST($1)]) |
|||
|
|||
|
|||
# AM_MISSING_HAS_RUN |
|||
# ------------------ |
|||
# Define MISSING if not defined so far and test if it supports --run. |
|||
# If it does, set am_missing_run to use it, otherwise, to nothing. |
|||
AC_DEFUN([AM_MISSING_HAS_RUN], |
|||
[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl |
|||
AC_REQUIRE_AUX_FILE([missing])dnl |
|||
if test x"${MISSING+set}" != xset; then |
|||
case $am_aux_dir in |
|||
*\ * | *\ *) |
|||
MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; |
|||
*) |
|||
MISSING="\${SHELL} $am_aux_dir/missing" ;; |
|||
esac |
|||
fi |
|||
# Use eval to expand $SHELL |
|||
if eval "$MISSING --run true"; then |
|||
am_missing_run="$MISSING --run " |
|||
else |
|||
am_missing_run= |
|||
AC_MSG_WARN([`missing' script is too old or missing]) |
|||
fi |
|||
]) |
|||
|
|||
# Copyright (C) 2003, 2004, 2005, 2006, 2011 Free Software Foundation, |
|||
# Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 1 |
|||
|
|||
# AM_PROG_MKDIR_P |
|||
# --------------- |
|||
# Check for `mkdir -p'. |
|||
AC_DEFUN([AM_PROG_MKDIR_P], |
|||
[AC_PREREQ([2.60])dnl |
|||
AC_REQUIRE([AC_PROG_MKDIR_P])dnl |
|||
dnl Automake 1.8 to 1.9.6 used to define mkdir_p. We now use MKDIR_P, |
|||
dnl while keeping a definition of mkdir_p for backward compatibility. |
|||
dnl @MKDIR_P@ is magic: AC_OUTPUT adjusts its value for each Makefile. |
|||
dnl However we cannot define mkdir_p as $(MKDIR_P) for the sake of |
|||
dnl Makefile.ins that do not define MKDIR_P, so we do our own |
|||
dnl adjustment using top_builddir (which is defined more often than |
|||
dnl MKDIR_P). |
|||
AC_SUBST([mkdir_p], ["$MKDIR_P"])dnl |
|||
case $mkdir_p in |
|||
[[\\/$]]* | ?:[[\\/]]*) ;; |
|||
*/*) mkdir_p="\$(top_builddir)/$mkdir_p" ;; |
|||
esac |
|||
]) |
|||
|
|||
# Copyright (C) 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006, 2012 |
|||
# Free Software Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 6 |
|||
|
|||
# AM_ENABLE_MULTILIB([MAKEFILE], [REL-TO-TOP-SRCDIR]) |
|||
# --------------------------------------------------- |
|||
# Add --enable-multilib to configure. |
|||
AC_DEFUN([AM_ENABLE_MULTILIB], |
|||
[m4_warn([obsolete], [$0 will be removed from Automake core soon. |
|||
Files implementing the "multilib" feature are (and will remain) available |
|||
to the 'contrib/' directory in the Automake distribution.])]dnl |
|||
[# Default to --enable-multilib |
|||
AC_ARG_ENABLE(multilib, |
|||
[ --enable-multilib build many library versions (default)], |
|||
[case "$enableval" in |
|||
yes) multilib=yes ;; |
|||
no) multilib=no ;; |
|||
*) AC_MSG_ERROR([bad value $enableval for multilib option]) ;; |
|||
esac], |
|||
[multilib=yes]) |
|||
|
|||
# We may get other options which we leave undocumented: |
|||
# --with-target-subdir, --with-multisrctop, --with-multisubdir |
|||
# See config-ml.in if you want the gory details. |
|||
|
|||
if test "$srcdir" = "."; then |
|||
if test "$with_target_subdir" != "."; then |
|||
multi_basedir="$srcdir/$with_multisrctop../$2" |
|||
else |
|||
multi_basedir="$srcdir/$with_multisrctop$2" |
|||
fi |
|||
else |
|||
multi_basedir="$srcdir/$2" |
|||
fi |
|||
AC_SUBST(multi_basedir) |
|||
|
|||
# Even if the default multilib is not a cross compilation, |
|||
# it may be that some of the other multilibs are. |
|||
if test $cross_compiling = no && test $multilib = yes \ |
|||
&& test "x${with_multisubdir}" != x ; then |
|||
cross_compiling=maybe |
|||
fi |
|||
|
|||
AC_OUTPUT_COMMANDS([ |
|||
# Only add multilib support code if we just rebuilt the top-level |
|||
# Makefile. |
|||
case " $CONFIG_FILES " in |
|||
*" ]m4_default([$1],Makefile)[ "*) |
|||
ac_file=]m4_default([$1],Makefile)[ . ${multi_basedir}/config-ml.in |
|||
;; |
|||
esac], |
|||
[ |
|||
srcdir="$srcdir" |
|||
host="$host" |
|||
target="$target" |
|||
with_multisubdir="$with_multisubdir" |
|||
with_multisrctop="$with_multisrctop" |
|||
with_target_subdir="$with_target_subdir" |
|||
ac_configure_args="${multilib_arg} ${ac_configure_args}" |
|||
multi_basedir="$multi_basedir" |
|||
CONFIG_SHELL=${CONFIG_SHELL-/bin/sh} |
|||
CC="$CC"])])dnl |
|||
|
|||
# Helper functions for option handling. -*- Autoconf -*- |
|||
|
|||
# Copyright (C) 2001, 2002, 2003, 2005, 2008, 2010 Free Software |
|||
# Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 5 |
|||
|
|||
# _AM_MANGLE_OPTION(NAME) |
|||
# ----------------------- |
|||
AC_DEFUN([_AM_MANGLE_OPTION], |
|||
[[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])]) |
|||
|
|||
# _AM_SET_OPTION(NAME) |
|||
# -------------------- |
|||
# Set option NAME. Presently that only means defining a flag for this option. |
|||
AC_DEFUN([_AM_SET_OPTION], |
|||
[m4_define(_AM_MANGLE_OPTION([$1]), 1)]) |
|||
|
|||
# _AM_SET_OPTIONS(OPTIONS) |
|||
# ------------------------ |
|||
# OPTIONS is a space-separated list of Automake options. |
|||
AC_DEFUN([_AM_SET_OPTIONS], |
|||
[m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])]) |
|||
|
|||
# _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET]) |
|||
# ------------------------------------------- |
|||
# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. |
|||
AC_DEFUN([_AM_IF_OPTION], |
|||
[m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) |
|||
|
|||
# Check to make sure that the build environment is sane. -*- Autoconf -*- |
|||
|
|||
# Copyright (C) 1996, 1997, 2000, 2001, 2003, 2005, 2008 |
|||
# Free Software Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 5 |
|||
|
|||
# AM_SANITY_CHECK |
|||
# --------------- |
|||
AC_DEFUN([AM_SANITY_CHECK], |
|||
[AC_MSG_CHECKING([whether build environment is sane]) |
|||
# Just in case |
|||
sleep 1 |
|||
echo timestamp > conftest.file |
|||
# Reject unsafe characters in $srcdir or the absolute working directory |
|||
# name. Accept space and tab only in the latter. |
|||
am_lf=' |
|||
' |
|||
case `pwd` in |
|||
*[[\\\"\#\$\&\'\`$am_lf]]*) |
|||
AC_MSG_ERROR([unsafe absolute working directory name]);; |
|||
esac |
|||
case $srcdir in |
|||
*[[\\\"\#\$\&\'\`$am_lf\ \ ]]*) |
|||
AC_MSG_ERROR([unsafe srcdir value: `$srcdir']);; |
|||
esac |
|||
|
|||
# Do `set' in a subshell so we don't clobber the current shell's |
|||
# arguments. Must try -L first in case configure is actually a |
|||
# symlink; some systems play weird games with the mod time of symlinks |
|||
# (eg FreeBSD returns the mod time of the symlink's containing |
|||
# directory). |
|||
if ( |
|||
set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` |
|||
if test "$[*]" = "X"; then |
|||
# -L didn't work. |
|||
set X `ls -t "$srcdir/configure" conftest.file` |
|||
fi |
|||
rm -f conftest.file |
|||
if test "$[*]" != "X $srcdir/configure conftest.file" \ |
|||
&& test "$[*]" != "X conftest.file $srcdir/configure"; then |
|||
|
|||
# If neither matched, then we have a broken ls. This can happen |
|||
# if, for instance, CONFIG_SHELL is bash and it inherits a |
|||
# broken ls alias from the environment. This has actually |
|||
# happened. Such a system could not be considered "sane". |
|||
AC_MSG_ERROR([ls -t appears to fail. Make sure there is not a broken |
|||
alias in your environment]) |
|||
fi |
|||
|
|||
test "$[2]" = conftest.file |
|||
) |
|||
then |
|||
# Ok. |
|||
: |
|||
else |
|||
AC_MSG_ERROR([newly created file is older than distributed files! |
|||
Check your system clock]) |
|||
fi |
|||
AC_MSG_RESULT(yes)]) |
|||
|
|||
# Copyright (C) 2001, 2003, 2005, 2011 Free Software Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 1 |
|||
|
|||
# AM_PROG_INSTALL_STRIP |
|||
# --------------------- |
|||
# One issue with vendor `install' (even GNU) is that you can't |
|||
# specify the program used to strip binaries. This is especially |
|||
# annoying in cross-compiling environments, where the build's strip |
|||
# is unlikely to handle the host's binaries. |
|||
# Fortunately install-sh will honor a STRIPPROG variable, so we |
|||
# always use install-sh in `make install-strip', and initialize |
|||
# STRIPPROG with the value of the STRIP variable (set by the user). |
|||
AC_DEFUN([AM_PROG_INSTALL_STRIP], |
|||
[AC_REQUIRE([AM_PROG_INSTALL_SH])dnl |
|||
# Installed binaries are usually stripped using `strip' when the user |
|||
# run `make install-strip'. However `strip' might not be the right |
|||
# tool to use in cross-compilation environments, therefore Automake |
|||
# will honor the `STRIP' environment variable to overrule this program. |
|||
dnl Don't test for $cross_compiling = yes, because it might be `maybe'. |
|||
if test "$cross_compiling" != no; then |
|||
AC_CHECK_TOOL([STRIP], [strip], :) |
|||
fi |
|||
INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" |
|||
AC_SUBST([INSTALL_STRIP_PROGRAM])]) |
|||
|
|||
# Copyright (C) 2006, 2008, 2010 Free Software Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 3 |
|||
|
|||
# _AM_SUBST_NOTMAKE(VARIABLE) |
|||
# --------------------------- |
|||
# Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in. |
|||
# This macro is traced by Automake. |
|||
AC_DEFUN([_AM_SUBST_NOTMAKE]) |
|||
|
|||
# AM_SUBST_NOTMAKE(VARIABLE) |
|||
# -------------------------- |
|||
# Public sister of _AM_SUBST_NOTMAKE. |
|||
AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)]) |
|||
|
|||
# Check how to create a tarball. -*- Autoconf -*- |
|||
|
|||
# Copyright (C) 2004, 2005, 2012 Free Software Foundation, Inc. |
|||
# |
|||
# This file is free software; the Free Software Foundation |
|||
# gives unlimited permission to copy and/or distribute it, |
|||
# with or without modifications, as long as this notice is preserved. |
|||
|
|||
# serial 2 |
|||
|
|||
# _AM_PROG_TAR(FORMAT) |
|||
# -------------------- |
|||
# Check how to create a tarball in format FORMAT. |
|||
# FORMAT should be one of `v7', `ustar', or `pax'. |
|||
# |
|||
# Substitute a variable $(am__tar) that is a command |
|||
# writing to stdout a FORMAT-tarball containing the directory |
|||
# $tardir. |
|||
# tardir=directory && $(am__tar) > result.tar |
|||
# |
|||
# Substitute a variable $(am__untar) that extract such |
|||
# a tarball read from stdin. |
|||
# $(am__untar) < result.tar |
|||
AC_DEFUN([_AM_PROG_TAR], |
|||
[# Always define AMTAR for backward compatibility. Yes, it's still used |
|||
# in the wild :-( We should find a proper way to deprecate it ... |
|||
AC_SUBST([AMTAR], ['$${TAR-tar}']) |
|||
m4_if([$1], [v7], |
|||
[am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'], |
|||
[m4_case([$1], [ustar],, [pax],, |
|||
[m4_fatal([Unknown tar format])]) |
|||
AC_MSG_CHECKING([how to create a $1 tar archive]) |
|||
# Loop over all known methods to create a tar archive until one works. |
|||
_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' |
|||
_am_tools=${am_cv_prog_tar_$1-$_am_tools} |
|||
# Do not fold the above two line into one, because Tru64 sh and |
|||
# Solaris sh will not grok spaces in the rhs of `-'. |
|||
for _am_tool in $_am_tools |
|||
do |
|||
case $_am_tool in |
|||
gnutar) |
|||
for _am_tar in tar gnutar gtar; |
|||
do |
|||
AM_RUN_LOG([$_am_tar --version]) && break |
|||
done |
|||
am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"' |
|||
am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"' |
|||
am__untar="$_am_tar -xf -" |
|||
;; |
|||
plaintar) |
|||
# Must skip GNU tar: if it does not support --format= it doesn't create |
|||
# ustar tarball either. |
|||
(tar --version) >/dev/null 2>&1 && continue |
|||
am__tar='tar chf - "$$tardir"' |
|||
am__tar_='tar chf - "$tardir"' |
|||
am__untar='tar xf -' |
|||
;; |
|||
pax) |
|||
am__tar='pax -L -x $1 -w "$$tardir"' |
|||
am__tar_='pax -L -x $1 -w "$tardir"' |
|||
am__untar='pax -r' |
|||
;; |
|||
cpio) |
|||
am__tar='find "$$tardir" -print | cpio -o -H $1 -L' |
|||
am__tar_='find "$tardir" -print | cpio -o -H $1 -L' |
|||
am__untar='cpio -i -H $1 -d' |
|||
;; |
|||
none) |
|||
am__tar=false |
|||
am__tar_=false |
|||
am__untar=false |
|||
;; |
|||
esac |
|||
|
|||
# If the value was cached, stop now. We just wanted to have am__tar |
|||
# and am__untar set. |
|||
test -n "${am_cv_prog_tar_$1}" && break |
|||
|
|||
# tar/untar a dummy directory, and stop if the command works |
|||
rm -rf conftest.dir |
|||
mkdir conftest.dir |
|||
echo GrepMe > conftest.dir/file |
|||
AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar]) |
|||
rm -rf conftest.dir |
|||
if test -s conftest.tar; then |
|||
AM_RUN_LOG([$am__untar <conftest.tar]) |
|||
grep GrepMe conftest.dir/file >/dev/null 2>&1 && break |
|||
fi |
|||
done |
|||
rm -rf conftest.dir |
|||
|
|||
AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool]) |
|||
AC_MSG_RESULT([$am_cv_prog_tar_$1])]) |
|||
AC_SUBST([am__tar]) |
|||
AC_SUBST([am__untar]) |
|||
]) # _AM_PROG_TAR |
|||
|
|||
m4_include([config/libtool.m4]) |
|||
m4_include([config/ltoptions.m4]) |
|||
m4_include([config/ltsugar.m4]) |
|||
m4_include([config/ltversion.m4]) |
|||
m4_include([config/lt~obsolete.m4]) |
|||
m4_include([acinclude.m4]) |
@ -0,0 +1,156 @@ |
|||
/* alloc.c -- Memory allocation without mmap.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <errno.h> |
|||
#include <stdlib.h> |
|||
#include <sys/types.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
/* Allocation routines to use on systems that do not support anonymous
|
|||
mmap. This implementation just uses malloc, which means that the |
|||
backtrace functions may not be safely invoked from a signal |
|||
handler. */ |
|||
|
|||
/* Allocate memory like malloc. If ERROR_CALLBACK is NULL, don't
|
|||
report an error. */ |
|||
|
|||
void * |
|||
backtrace_alloc (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
size_t size, backtrace_error_callback error_callback, |
|||
void *data) |
|||
{ |
|||
void *ret; |
|||
|
|||
ret = malloc (size); |
|||
if (ret == NULL) |
|||
{ |
|||
if (error_callback) |
|||
error_callback (data, "malloc", errno); |
|||
} |
|||
return ret; |
|||
} |
|||
|
|||
/* Free memory. */ |
|||
|
|||
void |
|||
backtrace_free (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
void *p, size_t size ATTRIBUTE_UNUSED, |
|||
backtrace_error_callback error_callback ATTRIBUTE_UNUSED, |
|||
void *data ATTRIBUTE_UNUSED) |
|||
{ |
|||
free (p); |
|||
} |
|||
|
|||
/* Grow VEC by SIZE bytes. */ |
|||
|
|||
void * |
|||
backtrace_vector_grow (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
size_t size, backtrace_error_callback error_callback, |
|||
void *data, struct backtrace_vector *vec) |
|||
{ |
|||
void *ret; |
|||
|
|||
if (size > vec->alc) |
|||
{ |
|||
size_t alc; |
|||
void *base; |
|||
|
|||
if (vec->size == 0) |
|||
alc = 32 * size; |
|||
else if (vec->size >= 4096) |
|||
alc = vec->size + 4096; |
|||
else |
|||
alc = 2 * vec->size; |
|||
|
|||
if (alc < vec->size + size) |
|||
alc = vec->size + size; |
|||
|
|||
base = realloc (vec->base, alc); |
|||
if (base == NULL) |
|||
{ |
|||
error_callback (data, "realloc", errno); |
|||
return NULL; |
|||
} |
|||
|
|||
vec->base = base; |
|||
vec->alc = alc - vec->size; |
|||
} |
|||
|
|||
ret = (char *) vec->base + vec->size; |
|||
vec->size += size; |
|||
vec->alc -= size; |
|||
return ret; |
|||
} |
|||
|
|||
/* Finish the current allocation on VEC. */ |
|||
|
|||
void * |
|||
backtrace_vector_finish (struct backtrace_state *state, |
|||
struct backtrace_vector *vec, |
|||
backtrace_error_callback error_callback, |
|||
void *data) |
|||
{ |
|||
void *ret; |
|||
|
|||
/* With this allocator we call realloc in backtrace_vector_grow,
|
|||
which means we can't easily reuse the memory here. So just |
|||
release it. */ |
|||
if (!backtrace_vector_release (state, vec, error_callback, data)) |
|||
return NULL; |
|||
ret = vec->base; |
|||
vec->base = NULL; |
|||
vec->size = 0; |
|||
vec->alc = 0; |
|||
return ret; |
|||
} |
|||
|
|||
/* Release any extra space allocated for VEC. */ |
|||
|
|||
int |
|||
backtrace_vector_release (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
struct backtrace_vector *vec, |
|||
backtrace_error_callback error_callback, |
|||
void *data) |
|||
{ |
|||
vec->base = realloc (vec->base, vec->size); |
|||
if (vec->base == NULL) |
|||
{ |
|||
error_callback (data, "realloc", errno); |
|||
return 0; |
|||
} |
|||
vec->alc = 0; |
|||
return 1; |
|||
} |
@ -0,0 +1,113 @@ |
|||
/* atomic.c -- Support for atomic functions if not present.
|
|||
Copyright (C) 2013-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <sys/types.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "backtrace-supported.h" |
|||
#include "internal.h" |
|||
|
|||
/* This file holds implementations of the atomic functions that are
|
|||
used if the host compiler has the sync functions but not the atomic |
|||
functions, as is true of versions of GCC before 4.7. */ |
|||
|
|||
#if !defined (HAVE_ATOMIC_FUNCTIONS) && defined (HAVE_SYNC_FUNCTIONS) |
|||
|
|||
/* Do an atomic load of a pointer. */ |
|||
|
|||
void * |
|||
backtrace_atomic_load_pointer (void *arg) |
|||
{ |
|||
void **pp; |
|||
void *p; |
|||
|
|||
pp = (void **) arg; |
|||
p = *pp; |
|||
while (!__sync_bool_compare_and_swap (pp, p, p)) |
|||
p = *pp; |
|||
return p; |
|||
} |
|||
|
|||
/* Do an atomic load of an int. */ |
|||
|
|||
int |
|||
backtrace_atomic_load_int (int *p) |
|||
{ |
|||
int i; |
|||
|
|||
i = *p; |
|||
while (!__sync_bool_compare_and_swap (p, i, i)) |
|||
i = *p; |
|||
return i; |
|||
} |
|||
|
|||
/* Do an atomic store of a pointer. */ |
|||
|
|||
void |
|||
backtrace_atomic_store_pointer (void *arg, void *p) |
|||
{ |
|||
void **pp; |
|||
void *old; |
|||
|
|||
pp = (void **) arg; |
|||
old = *pp; |
|||
while (!__sync_bool_compare_and_swap (pp, old, p)) |
|||
old = *pp; |
|||
} |
|||
|
|||
/* Do an atomic store of a size_t value. */ |
|||
|
|||
void |
|||
backtrace_atomic_store_size_t (size_t *p, size_t v) |
|||
{ |
|||
size_t old; |
|||
|
|||
old = *p; |
|||
while (!__sync_bool_compare_and_swap (p, old, v)) |
|||
old = *p; |
|||
} |
|||
|
|||
/* Do an atomic store of a int value. */ |
|||
|
|||
void |
|||
backtrace_atomic_store_int (int *p, int v) |
|||
{ |
|||
size_t old; |
|||
|
|||
old = *p; |
|||
while (!__sync_bool_compare_and_swap (p, old, v)) |
|||
old = *p; |
|||
} |
|||
|
|||
#endif |
@ -0,0 +1,66 @@ |
|||
/* backtrace-supported.h.in -- Whether stack backtrace is supported.
|
|||
Copyright (C) 2012-2016 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
/* The file backtrace-supported.h.in is used by configure to generate
|
|||
the file backtrace-supported.h. The file backtrace-supported.h may |
|||
be #include'd to see whether the backtrace library will be able to |
|||
get a backtrace and produce symbolic information. */ |
|||
|
|||
|
|||
/* BACKTRACE_SUPPORTED will be #define'd as 1 if the backtrace library
|
|||
should work, 0 if it will not. Libraries may #include this to make |
|||
other arrangements. */ |
|||
|
|||
#define BACKTRACE_SUPPORTED @BACKTRACE_SUPPORTED@ |
|||
|
|||
/* BACKTRACE_USES_MALLOC will be #define'd as 1 if the backtrace
|
|||
library will call malloc as it works, 0 if it will call mmap |
|||
instead. This may be used to determine whether it is safe to call |
|||
the backtrace functions from a signal handler. In general this |
|||
only applies to calls like backtrace and backtrace_pcinfo. It does |
|||
not apply to backtrace_simple, which never calls malloc. It does |
|||
not apply to backtrace_print, which always calls fprintf and |
|||
therefore malloc. */ |
|||
|
|||
#define BACKTRACE_USES_MALLOC @BACKTRACE_USES_MALLOC@ |
|||
|
|||
/* BACKTRACE_SUPPORTS_THREADS will be #define'd as 1 if the backtrace
|
|||
library is configured with threading support, 0 if not. If this is |
|||
0, the threaded parameter to backtrace_create_state must be passed |
|||
as 0. */ |
|||
|
|||
#define BACKTRACE_SUPPORTS_THREADS @BACKTRACE_SUPPORTS_THREADS@ |
|||
|
|||
/* BACKTRACE_SUPPORTS_DATA will be #defined'd as 1 if the backtrace_syminfo
|
|||
will work for variables. It will always work for functions. */ |
|||
|
|||
#define BACKTRACE_SUPPORTS_DATA @BACKTRACE_SUPPORTS_DATA@ |
@ -0,0 +1,129 @@ |
|||
/* backtrace.c -- Entry point for stack backtrace library.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <sys/types.h> |
|||
|
|||
#include "unwind.h" |
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
/* The main backtrace_full routine. */ |
|||
|
|||
/* Data passed through _Unwind_Backtrace. */ |
|||
|
|||
struct backtrace_data |
|||
{ |
|||
/* Number of frames to skip. */ |
|||
int skip; |
|||
/* Library state. */ |
|||
struct backtrace_state *state; |
|||
/* Callback routine. */ |
|||
backtrace_full_callback callback; |
|||
/* Error callback routine. */ |
|||
backtrace_error_callback error_callback; |
|||
/* Data to pass to callback routines. */ |
|||
void *data; |
|||
/* Value to return from backtrace_full. */ |
|||
int ret; |
|||
/* Whether there is any memory available. */ |
|||
int can_alloc; |
|||
}; |
|||
|
|||
/* Unwind library callback routine. This is passed to
|
|||
_Unwind_Backtrace. */ |
|||
|
|||
static _Unwind_Reason_Code |
|||
unwind (struct _Unwind_Context *context, void *vdata) |
|||
{ |
|||
struct backtrace_data *bdata = (struct backtrace_data *) vdata; |
|||
uintptr_t pc; |
|||
int ip_before_insn = 0; |
|||
|
|||
#ifdef HAVE_GETIPINFO |
|||
pc = _Unwind_GetIPInfo (context, &ip_before_insn); |
|||
#else |
|||
pc = _Unwind_GetIP (context); |
|||
#endif |
|||
|
|||
if (bdata->skip > 0) |
|||
{ |
|||
--bdata->skip; |
|||
return _URC_NO_REASON; |
|||
} |
|||
|
|||
if (!ip_before_insn) |
|||
--pc; |
|||
|
|||
if (!bdata->can_alloc) |
|||
bdata->ret = bdata->callback (bdata->data, pc, NULL, 0, NULL); |
|||
else |
|||
bdata->ret = backtrace_pcinfo (bdata->state, pc, bdata->callback, |
|||
bdata->error_callback, bdata->data); |
|||
if (bdata->ret != 0) |
|||
return _URC_END_OF_STACK; |
|||
|
|||
return _URC_NO_REASON; |
|||
} |
|||
|
|||
/* Get a stack backtrace. */ |
|||
|
|||
int |
|||
backtrace_full (struct backtrace_state *state, int skip, |
|||
backtrace_full_callback callback, |
|||
backtrace_error_callback error_callback, void *data) |
|||
{ |
|||
struct backtrace_data bdata; |
|||
void *p; |
|||
|
|||
bdata.skip = skip + 1; |
|||
bdata.state = state; |
|||
bdata.callback = callback; |
|||
bdata.error_callback = error_callback; |
|||
bdata.data = data; |
|||
bdata.ret = 0; |
|||
|
|||
/* If we can't allocate any memory at all, don't try to produce
|
|||
file/line information. */ |
|||
p = backtrace_alloc (state, 4096, NULL, NULL); |
|||
if (p == NULL) |
|||
bdata.can_alloc = 0; |
|||
else |
|||
{ |
|||
backtrace_free (state, p, 4096, NULL, NULL); |
|||
bdata.can_alloc = 1; |
|||
} |
|||
|
|||
_Unwind_Backtrace (unwind, &bdata); |
|||
return bdata.ret; |
|||
} |
@ -0,0 +1,182 @@ |
|||
/* backtrace.h -- Public header file for stack backtrace library.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#ifndef BACKTRACE_H |
|||
#define BACKTRACE_H |
|||
|
|||
#include <stddef.h> |
|||
#include <stdint.h> |
|||
#include <stdio.h> |
|||
|
|||
#ifdef __cplusplus |
|||
extern "C" { |
|||
#endif |
|||
|
|||
/* The backtrace state. This struct is intentionally not defined in
|
|||
the public interface. */ |
|||
|
|||
struct backtrace_state; |
|||
|
|||
/* The type of the error callback argument to backtrace functions.
|
|||
This function, if not NULL, will be called for certain error cases. |
|||
The DATA argument is passed to the function that calls this one. |
|||
The MSG argument is an error message. The ERRNUM argument, if |
|||
greater than 0, holds an errno value. The MSG buffer may become |
|||
invalid after this function returns. |
|||
|
|||
As a special case, the ERRNUM argument will be passed as -1 if no |
|||
debug info can be found for the executable, but the function |
|||
requires debug info (e.g., backtrace_full, backtrace_pcinfo). The |
|||
MSG in this case will be something along the lines of "no debug |
|||
info". Similarly, ERRNUM will be passed as -1 if there is no |
|||
symbol table, but the function requires a symbol table (e.g., |
|||
backtrace_syminfo). This may be used as a signal that some other |
|||
approach should be tried. */ |
|||
|
|||
typedef void (*backtrace_error_callback) (void *data, const char *msg, |
|||
int errnum); |
|||
|
|||
/* Create state information for the backtrace routines. This must be
|
|||
called before any of the other routines, and its return value must |
|||
be passed to all of the other routines. FILENAME is the path name |
|||
of the executable file; if it is NULL the library will try |
|||
system-specific path names. If not NULL, FILENAME must point to a |
|||
permanent buffer. If THREADED is non-zero the state may be |
|||
accessed by multiple threads simultaneously, and the library will |
|||
use appropriate atomic operations. If THREADED is zero the state |
|||
may only be accessed by one thread at a time. This returns a state |
|||
pointer on success, NULL on error. If an error occurs, this will |
|||
call the ERROR_CALLBACK routine. */ |
|||
|
|||
extern struct backtrace_state *backtrace_create_state ( |
|||
const char *filename, int threaded, |
|||
backtrace_error_callback error_callback, void *data); |
|||
|
|||
/* The type of the callback argument to the backtrace_full function.
|
|||
DATA is the argument passed to backtrace_full. PC is the program |
|||
counter. FILENAME is the name of the file containing PC, or NULL |
|||
if not available. LINENO is the line number in FILENAME containing |
|||
PC, or 0 if not available. FUNCTION is the name of the function |
|||
containing PC, or NULL if not available. This should return 0 to |
|||
continuing tracing. The FILENAME and FUNCTION buffers may become |
|||
invalid after this function returns. */ |
|||
|
|||
typedef int (*backtrace_full_callback) (void *data, uintptr_t pc, |
|||
const char *filename, int lineno, |
|||
const char *function); |
|||
|
|||
/* Get a full stack backtrace. SKIP is the number of frames to skip;
|
|||
passing 0 will start the trace with the function calling |
|||
backtrace_full. DATA is passed to the callback routine. If any |
|||
call to CALLBACK returns a non-zero value, the stack backtrace |
|||
stops, and backtrace returns that value; this may be used to limit |
|||
the number of stack frames desired. If all calls to CALLBACK |
|||
return 0, backtrace returns 0. The backtrace_full function will |
|||
make at least one call to either CALLBACK or ERROR_CALLBACK. This |
|||
function requires debug info for the executable. */ |
|||
|
|||
extern int backtrace_full (struct backtrace_state *state, int skip, |
|||
backtrace_full_callback callback, |
|||
backtrace_error_callback error_callback, |
|||
void *data); |
|||
|
|||
/* The type of the callback argument to the backtrace_simple function.
|
|||
DATA is the argument passed to simple_backtrace. PC is the program |
|||
counter. This should return 0 to continue tracing. */ |
|||
|
|||
typedef int (*backtrace_simple_callback) (void *data, uintptr_t pc); |
|||
|
|||
/* Get a simple backtrace. SKIP is the number of frames to skip, as
|
|||
in backtrace. DATA is passed to the callback routine. If any call |
|||
to CALLBACK returns a non-zero value, the stack backtrace stops, |
|||
and backtrace_simple returns that value. Otherwise |
|||
backtrace_simple returns 0. The backtrace_simple function will |
|||
make at least one call to either CALLBACK or ERROR_CALLBACK. This |
|||
function does not require any debug info for the executable. */ |
|||
|
|||
extern int backtrace_simple (struct backtrace_state *state, int skip, |
|||
backtrace_simple_callback callback, |
|||
backtrace_error_callback error_callback, |
|||
void *data); |
|||
|
|||
/* Print the current backtrace in a user readable format to a FILE.
|
|||
SKIP is the number of frames to skip, as in backtrace_full. Any |
|||
error messages are printed to stderr. This function requires debug |
|||
info for the executable. */ |
|||
|
|||
extern void backtrace_print (struct backtrace_state *state, int skip, FILE *); |
|||
|
|||
/* Given PC, a program counter in the current program, call the
|
|||
callback function with filename, line number, and function name |
|||
information. This will normally call the callback function exactly |
|||
once. However, if the PC happens to describe an inlined call, and |
|||
the debugging information contains the necessary information, then |
|||
this may call the callback function multiple times. This will make |
|||
at least one call to either CALLBACK or ERROR_CALLBACK. This |
|||
returns the first non-zero value returned by CALLBACK, or 0. */ |
|||
|
|||
extern int backtrace_pcinfo (struct backtrace_state *state, uintptr_t pc, |
|||
backtrace_full_callback callback, |
|||
backtrace_error_callback error_callback, |
|||
void *data); |
|||
|
|||
/* The type of the callback argument to backtrace_syminfo. DATA and
|
|||
PC are the arguments passed to backtrace_syminfo. SYMNAME is the |
|||
name of the symbol for the corresponding code. SYMVAL is the |
|||
value and SYMSIZE is the size of the symbol. SYMNAME will be NULL |
|||
if no error occurred but the symbol could not be found. */ |
|||
|
|||
typedef void (*backtrace_syminfo_callback) (void *data, uintptr_t pc, |
|||
const char *symname, |
|||
uintptr_t symval, |
|||
uintptr_t symsize); |
|||
|
|||
/* Given ADDR, an address or program counter in the current program,
|
|||
call the callback information with the symbol name and value |
|||
describing the function or variable in which ADDR may be found. |
|||
This will call either CALLBACK or ERROR_CALLBACK exactly once. |
|||
This returns 1 on success, 0 on failure. This function requires |
|||
the symbol table but does not require the debug info. Note that if |
|||
the symbol table is present but ADDR could not be found in the |
|||
table, CALLBACK will be called with a NULL SYMNAME argument. |
|||
Returns 1 on success, 0 on error. */ |
|||
|
|||
extern int backtrace_syminfo (struct backtrace_state *state, uintptr_t addr, |
|||
backtrace_syminfo_callback callback, |
|||
backtrace_error_callback error_callback, |
|||
void *data); |
|||
|
|||
#ifdef __cplusplus |
|||
} /* End extern "C". */ |
|||
#endif |
|||
|
|||
#endif |
@ -0,0 +1,500 @@ |
|||
/* btest.c -- Test for libbacktrace library
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
/* This program tests the externally visible interfaces of the
|
|||
libbacktrace library. */ |
|||
|
|||
#include <assert.h> |
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
#include <unistd.h> |
|||
|
|||
#include "filenames.h" |
|||
|
|||
#include "backtrace.h" |
|||
#include "backtrace-supported.h" |
|||
|
|||
#include "testlib.h" |
|||
|
|||
/* Test the backtrace function with non-inlined functions. */ |
|||
|
|||
static int test1 (void) __attribute__ ((noinline, unused)); |
|||
static int f2 (int) __attribute__ ((noinline)); |
|||
static int f3 (int, int) __attribute__ ((noinline)); |
|||
|
|||
static int |
|||
test1 (void) |
|||
{ |
|||
/* Returning a value here and elsewhere avoids a tailcall which
|
|||
would mess up the backtrace. */ |
|||
return f2 (__LINE__) + 1; |
|||
} |
|||
|
|||
static int |
|||
f2 (int f1line) |
|||
{ |
|||
return f3 (f1line, __LINE__) + 2; |
|||
} |
|||
|
|||
static int |
|||
f3 (int f1line, int f2line) |
|||
{ |
|||
struct info all[20]; |
|||
struct bdata data; |
|||
int f3line; |
|||
int i; |
|||
|
|||
data.all = &all[0]; |
|||
data.index = 0; |
|||
data.max = 20; |
|||
data.failed = 0; |
|||
|
|||
f3line = __LINE__ + 1; |
|||
i = backtrace_full (state, 0, callback_one, error_callback_one, &data); |
|||
|
|||
if (i != 0) |
|||
{ |
|||
fprintf (stderr, "test1: unexpected return value %d\n", i); |
|||
data.failed = 1; |
|||
} |
|||
|
|||
if (data.index < 3) |
|||
{ |
|||
fprintf (stderr, |
|||
"test1: not enough frames; got %zu, expected at least 3\n", |
|||
data.index); |
|||
data.failed = 1; |
|||
} |
|||
|
|||
check ("test1", 0, all, f3line, "f3", "btest.c", &data.failed); |
|||
check ("test1", 1, all, f2line, "f2", "btest.c", &data.failed); |
|||
check ("test1", 2, all, f1line, "test1", "btest.c", &data.failed); |
|||
|
|||
printf ("%s: backtrace_full noinline\n", data.failed ? "FAIL" : "PASS"); |
|||
|
|||
if (data.failed) |
|||
++failures; |
|||
|
|||
return failures; |
|||
} |
|||
|
|||
/* Test the backtrace function with inlined functions. */ |
|||
|
|||
static inline int test2 (void) __attribute__ ((always_inline, unused)); |
|||
static inline int f12 (int) __attribute__ ((always_inline)); |
|||
static inline int f13 (int, int) __attribute__ ((always_inline)); |
|||
|
|||
static inline int |
|||
test2 (void) |
|||
{ |
|||
return f12 (__LINE__) + 1; |
|||
} |
|||
|
|||
static inline int |
|||
f12 (int f1line) |
|||
{ |
|||
return f13 (f1line, __LINE__) + 2; |
|||
} |
|||
|
|||
static inline int |
|||
f13 (int f1line, int f2line) |
|||
{ |
|||
struct info all[20]; |
|||
struct bdata data; |
|||
int f3line; |
|||
int i; |
|||
|
|||
data.all = &all[0]; |
|||
data.index = 0; |
|||
data.max = 20; |
|||
data.failed = 0; |
|||
|
|||
f3line = __LINE__ + 1; |
|||
i = backtrace_full (state, 0, callback_one, error_callback_one, &data); |
|||
|
|||
if (i != 0) |
|||
{ |
|||
fprintf (stderr, "test2: unexpected return value %d\n", i); |
|||
data.failed = 1; |
|||
} |
|||
|
|||
check ("test2", 0, all, f3line, "f13", "btest.c", &data.failed); |
|||
check ("test2", 1, all, f2line, "f12", "btest.c", &data.failed); |
|||
check ("test2", 2, all, f1line, "test2", "btest.c", &data.failed); |
|||
|
|||
printf ("%s: backtrace_full inline\n", data.failed ? "FAIL" : "PASS"); |
|||
|
|||
if (data.failed) |
|||
++failures; |
|||
|
|||
return failures; |
|||
} |
|||
|
|||
/* Test the backtrace_simple function with non-inlined functions. */ |
|||
|
|||
static int test3 (void) __attribute__ ((noinline, unused)); |
|||
static int f22 (int) __attribute__ ((noinline)); |
|||
static int f23 (int, int) __attribute__ ((noinline)); |
|||
|
|||
static int |
|||
test3 (void) |
|||
{ |
|||
return f22 (__LINE__) + 1; |
|||
} |
|||
|
|||
static int |
|||
f22 (int f1line) |
|||
{ |
|||
return f23 (f1line, __LINE__) + 2; |
|||
} |
|||
|
|||
static int |
|||
f23 (int f1line, int f2line) |
|||
{ |
|||
uintptr_t addrs[20]; |
|||
struct sdata data; |
|||
int f3line; |
|||
int i; |
|||
|
|||
data.addrs = &addrs[0]; |
|||
data.index = 0; |
|||
data.max = 20; |
|||
data.failed = 0; |
|||
|
|||
f3line = __LINE__ + 1; |
|||
i = backtrace_simple (state, 0, callback_two, error_callback_two, &data); |
|||
|
|||
if (i != 0) |
|||
{ |
|||
fprintf (stderr, "test3: unexpected return value %d\n", i); |
|||
data.failed = 1; |
|||
} |
|||
|
|||
if (!data.failed) |
|||
{ |
|||
struct info all[20]; |
|||
struct bdata bdata; |
|||
int j; |
|||
|
|||
bdata.all = &all[0]; |
|||
bdata.index = 0; |
|||
bdata.max = 20; |
|||
bdata.failed = 0; |
|||
|
|||
for (j = 0; j < 3; ++j) |
|||
{ |
|||
i = backtrace_pcinfo (state, addrs[j], callback_one, |
|||
error_callback_one, &bdata); |
|||
if (i != 0) |
|||
{ |
|||
fprintf (stderr, |
|||
("test3: unexpected return value " |
|||
"from backtrace_pcinfo %d\n"), |
|||
i); |
|||
bdata.failed = 1; |
|||
} |
|||
if (!bdata.failed && bdata.index != (size_t) (j + 1)) |
|||
{ |
|||
fprintf (stderr, |
|||
("wrong number of calls from backtrace_pcinfo " |
|||
"got %u expected %d\n"), |
|||
(unsigned int) bdata.index, j + 1); |
|||
bdata.failed = 1; |
|||
} |
|||
} |
|||
|
|||
check ("test3", 0, all, f3line, "f23", "btest.c", &bdata.failed); |
|||
check ("test3", 1, all, f2line, "f22", "btest.c", &bdata.failed); |
|||
check ("test3", 2, all, f1line, "test3", "btest.c", &bdata.failed); |
|||
|
|||
if (bdata.failed) |
|||
data.failed = 1; |
|||
|
|||
for (j = 0; j < 3; ++j) |
|||
{ |
|||
struct symdata symdata; |
|||
|
|||
symdata.name = NULL; |
|||
symdata.val = 0; |
|||
symdata.size = 0; |
|||
symdata.failed = 0; |
|||
|
|||
i = backtrace_syminfo (state, addrs[j], callback_three, |
|||
error_callback_three, &symdata); |
|||
if (i == 0) |
|||
{ |
|||
fprintf (stderr, |
|||
("test3: [%d]: unexpected return value " |
|||
"from backtrace_syminfo %d\n"), |
|||
j, i); |
|||
symdata.failed = 1; |
|||
} |
|||
|
|||
if (!symdata.failed) |
|||
{ |
|||
const char *expected; |
|||
|
|||
switch (j) |
|||
{ |
|||
case 0: |
|||
expected = "f23"; |
|||
break; |
|||
case 1: |
|||
expected = "f22"; |
|||
break; |
|||
case 2: |
|||
expected = "test3"; |
|||
break; |
|||
default: |
|||
assert (0); |
|||
} |
|||
|
|||
if (symdata.name == NULL) |
|||
{ |
|||
fprintf (stderr, "test3: [%d]: NULL syminfo name\n", j); |
|||
symdata.failed = 1; |
|||
} |
|||
/* Use strncmp, not strcmp, because GCC might create a
|
|||
clone. */ |
|||
else if (strncmp (symdata.name, expected, strlen (expected)) |
|||
!= 0) |
|||
{ |
|||
fprintf (stderr, |
|||
("test3: [%d]: unexpected syminfo name " |
|||
"got %s expected %s\n"), |
|||
j, symdata.name, expected); |
|||
symdata.failed = 1; |
|||
} |
|||
} |
|||
|
|||
if (symdata.failed) |
|||
data.failed = 1; |
|||
} |
|||
} |
|||
|
|||
printf ("%s: backtrace_simple noinline\n", data.failed ? "FAIL" : "PASS"); |
|||
|
|||
if (data.failed) |
|||
++failures; |
|||
|
|||
return failures; |
|||
} |
|||
|
|||
/* Test the backtrace_simple function with inlined functions. */ |
|||
|
|||
static inline int test4 (void) __attribute__ ((always_inline, unused)); |
|||
static inline int f32 (int) __attribute__ ((always_inline)); |
|||
static inline int f33 (int, int) __attribute__ ((always_inline)); |
|||
|
|||
static inline int |
|||
test4 (void) |
|||
{ |
|||
return f32 (__LINE__) + 1; |
|||
} |
|||
|
|||
static inline int |
|||
f32 (int f1line) |
|||
{ |
|||
return f33 (f1line, __LINE__) + 2; |
|||
} |
|||
|
|||
static inline int |
|||
f33 (int f1line, int f2line) |
|||
{ |
|||
uintptr_t addrs[20]; |
|||
struct sdata data; |
|||
int f3line; |
|||
int i; |
|||
|
|||
data.addrs = &addrs[0]; |
|||
data.index = 0; |
|||
data.max = 20; |
|||
data.failed = 0; |
|||
|
|||
f3line = __LINE__ + 1; |
|||
i = backtrace_simple (state, 0, callback_two, error_callback_two, &data); |
|||
|
|||
if (i != 0) |
|||
{ |
|||
fprintf (stderr, "test3: unexpected return value %d\n", i); |
|||
data.failed = 1; |
|||
} |
|||
|
|||
if (!data.failed) |
|||
{ |
|||
struct info all[20]; |
|||
struct bdata bdata; |
|||
|
|||
bdata.all = &all[0]; |
|||
bdata.index = 0; |
|||
bdata.max = 20; |
|||
bdata.failed = 0; |
|||
|
|||
i = backtrace_pcinfo (state, addrs[0], callback_one, error_callback_one, |
|||
&bdata); |
|||
if (i != 0) |
|||
{ |
|||
fprintf (stderr, |
|||
("test4: unexpected return value " |
|||
"from backtrace_pcinfo %d\n"), |
|||
i); |
|||
bdata.failed = 1; |
|||
} |
|||
|
|||
check ("test4", 0, all, f3line, "f33", "btest.c", &bdata.failed); |
|||
check ("test4", 1, all, f2line, "f32", "btest.c", &bdata.failed); |
|||
check ("test4", 2, all, f1line, "test4", "btest.c", &bdata.failed); |
|||
|
|||
if (bdata.failed) |
|||
data.failed = 1; |
|||
} |
|||
|
|||
printf ("%s: backtrace_simple inline\n", data.failed ? "FAIL" : "PASS"); |
|||
|
|||
if (data.failed) |
|||
++failures; |
|||
|
|||
return failures; |
|||
} |
|||
|
|||
static int test5 (void) __attribute__ ((unused)); |
|||
|
|||
int global = 1; |
|||
|
|||
static int |
|||
test5 (void) |
|||
{ |
|||
struct symdata symdata; |
|||
int i; |
|||
uintptr_t addr = (uintptr_t) &global; |
|||
|
|||
if (sizeof (global) > 1) |
|||
addr += 1; |
|||
|
|||
symdata.name = NULL; |
|||
symdata.val = 0; |
|||
symdata.size = 0; |
|||
symdata.failed = 0; |
|||
|
|||
i = backtrace_syminfo (state, addr, callback_three, |
|||
error_callback_three, &symdata); |
|||
if (i == 0) |
|||
{ |
|||
fprintf (stderr, |
|||
"test5: unexpected return value from backtrace_syminfo %d\n", |
|||
i); |
|||
symdata.failed = 1; |
|||
} |
|||
|
|||
if (!symdata.failed) |
|||
{ |
|||
if (symdata.name == NULL) |
|||
{ |
|||
fprintf (stderr, "test5: NULL syminfo name\n"); |
|||
symdata.failed = 1; |
|||
} |
|||
else if (strcmp (symdata.name, "global") != 0) |
|||
{ |
|||
fprintf (stderr, |
|||
"test5: unexpected syminfo name got %s expected %s\n", |
|||
symdata.name, "global"); |
|||
symdata.failed = 1; |
|||
} |
|||
else if (symdata.val != (uintptr_t) &global) |
|||
{ |
|||
fprintf (stderr, |
|||
"test5: unexpected syminfo value got %lx expected %lx\n", |
|||
(unsigned long) symdata.val, |
|||
(unsigned long) (uintptr_t) &global); |
|||
symdata.failed = 1; |
|||
} |
|||
else if (symdata.size != sizeof (global)) |
|||
{ |
|||
fprintf (stderr, |
|||
"test5: unexpected syminfo size got %lx expected %lx\n", |
|||
(unsigned long) symdata.size, |
|||
(unsigned long) sizeof (global)); |
|||
symdata.failed = 1; |
|||
} |
|||
} |
|||
|
|||
printf ("%s: backtrace_syminfo variable\n", |
|||
symdata.failed ? "FAIL" : "PASS"); |
|||
|
|||
if (symdata.failed) |
|||
++failures; |
|||
|
|||
return failures; |
|||
} |
|||
|
|||
/* Check that are no files left open. */ |
|||
|
|||
static void |
|||
check_open_files (void) |
|||
{ |
|||
int i; |
|||
|
|||
for (i = 3; i < 10; i++) |
|||
{ |
|||
if (close (i) == 0) |
|||
{ |
|||
fprintf (stderr, |
|||
"ERROR: descriptor %d still open after tests complete\n", |
|||
i); |
|||
++failures; |
|||
} |
|||
} |
|||
} |
|||
|
|||
/* Run all the tests. */ |
|||
|
|||
int |
|||
main (int argc ATTRIBUTE_UNUSED, char **argv) |
|||
{ |
|||
state = backtrace_create_state (argv[0], BACKTRACE_SUPPORTS_THREADS, |
|||
error_callback_create, NULL); |
|||
|
|||
#if BACKTRACE_SUPPORTED |
|||
test1 (); |
|||
test2 (); |
|||
test3 (); |
|||
test4 (); |
|||
#if BACKTRACE_SUPPORTS_DATA |
|||
test5 (); |
|||
#endif |
|||
#endif |
|||
|
|||
check_open_files (); |
|||
|
|||
exit (failures ? EXIT_FAILURE : EXIT_SUCCESS); |
|||
} |
File diff suppressed because it is too large
@ -0,0 +1,149 @@ |
|||
/* config.h.in. Generated from configure.ac by autoheader. */ |
|||
|
|||
/* ELF size: 32 or 64 */ |
|||
#undef BACKTRACE_ELF_SIZE |
|||
|
|||
/* XCOFF size: 32 or 64 */ |
|||
#undef BACKTRACE_XCOFF_SIZE |
|||
|
|||
/* Define to 1 if you have the __atomic functions */ |
|||
#undef HAVE_ATOMIC_FUNCTIONS |
|||
|
|||
/* Define to 1 if you have the `clock_gettime' function. */ |
|||
#undef HAVE_CLOCK_GETTIME |
|||
|
|||
/* Define to 1 if you have the declaration of `strnlen', and to 0 if you
|
|||
don't. */ |
|||
#undef HAVE_DECL_STRNLEN |
|||
|
|||
/* Define to 1 if you have the <dlfcn.h> header file. */ |
|||
#undef HAVE_DLFCN_H |
|||
|
|||
/* Define if dl_iterate_phdr is available. */ |
|||
#undef HAVE_DL_ITERATE_PHDR |
|||
|
|||
/* Define to 1 if you have the fcntl function */ |
|||
#undef HAVE_FCNTL |
|||
|
|||
/* Define if getexecname is available. */ |
|||
#undef HAVE_GETEXECNAME |
|||
|
|||
/* Define if _Unwind_GetIPInfo is available. */ |
|||
#undef HAVE_GETIPINFO |
|||
|
|||
/* Define to 1 if you have the <inttypes.h> header file. */ |
|||
#undef HAVE_INTTYPES_H |
|||
|
|||
/* Define to 1 if you have the `z' library (-lz). */ |
|||
#undef HAVE_LIBZ |
|||
|
|||
/* Define to 1 if you have the <link.h> header file. */ |
|||
#undef HAVE_LINK_H |
|||
|
|||
/* Define if AIX loadquery is available. */ |
|||
#undef HAVE_LOADQUERY |
|||
|
|||
/* Define to 1 if you have the `lstat' function. */ |
|||
#undef HAVE_LSTAT |
|||
|
|||
/* Define to 1 if you have the <memory.h> header file. */ |
|||
#undef HAVE_MEMORY_H |
|||
|
|||
/* Define to 1 if you have the `readlink' function. */ |
|||
#undef HAVE_READLINK |
|||
|
|||
/* Define to 1 if you have the <stdint.h> header file. */ |
|||
#undef HAVE_STDINT_H |
|||
|
|||
/* Define to 1 if you have the <stdlib.h> header file. */ |
|||
#undef HAVE_STDLIB_H |
|||
|
|||
/* Define to 1 if you have the <strings.h> header file. */ |
|||
#undef HAVE_STRINGS_H |
|||
|
|||
/* Define to 1 if you have the <string.h> header file. */ |
|||
#undef HAVE_STRING_H |
|||
|
|||
/* Define to 1 if you have the __sync functions */ |
|||
#undef HAVE_SYNC_FUNCTIONS |
|||
|
|||
/* Define to 1 if you have the <sys/ldr.h> header file. */ |
|||
#undef HAVE_SYS_LDR_H |
|||
|
|||
/* Define to 1 if you have the <sys/mman.h> header file. */ |
|||
#undef HAVE_SYS_MMAN_H |
|||
|
|||
/* Define to 1 if you have the <sys/stat.h> header file. */ |
|||
#undef HAVE_SYS_STAT_H |
|||
|
|||
/* Define to 1 if you have the <sys/types.h> header file. */ |
|||
#undef HAVE_SYS_TYPES_H |
|||
|
|||
/* Define to 1 if you have the <unistd.h> header file. */ |
|||
#undef HAVE_UNISTD_H |
|||
|
|||
/* Define if -lz is available. */ |
|||
#undef HAVE_ZLIB |
|||
|
|||
/* Define to the sub-directory in which libtool stores uninstalled libraries.
|
|||
*/ |
|||
#undef LT_OBJDIR |
|||
|
|||
/* Define to the address where bug reports for this package should be sent. */ |
|||
#undef PACKAGE_BUGREPORT |
|||
|
|||
/* Define to the full name of this package. */ |
|||
#undef PACKAGE_NAME |
|||
|
|||
/* Define to the full name and version of this package. */ |
|||
#undef PACKAGE_STRING |
|||
|
|||
/* Define to the one symbol short name of this package. */ |
|||
#undef PACKAGE_TARNAME |
|||
|
|||
/* Define to the home page for this package. */ |
|||
#undef PACKAGE_URL |
|||
|
|||
/* Define to the version of this package. */ |
|||
#undef PACKAGE_VERSION |
|||
|
|||
/* Define to 1 if you have the ANSI C header files. */ |
|||
#undef STDC_HEADERS |
|||
|
|||
/* Enable extensions on AIX 3, Interix. */ |
|||
#ifndef _ALL_SOURCE |
|||
# undef _ALL_SOURCE |
|||
#endif |
|||
/* Enable GNU extensions on systems that have them. */ |
|||
#ifndef _GNU_SOURCE |
|||
# undef _GNU_SOURCE |
|||
#endif |
|||
/* Enable threading extensions on Solaris. */ |
|||
#ifndef _POSIX_PTHREAD_SEMANTICS |
|||
# undef _POSIX_PTHREAD_SEMANTICS |
|||
#endif |
|||
/* Enable extensions on HP NonStop. */ |
|||
#ifndef _TANDEM_SOURCE |
|||
# undef _TANDEM_SOURCE |
|||
#endif |
|||
/* Enable general extensions on Solaris. */ |
|||
#ifndef __EXTENSIONS__ |
|||
# undef __EXTENSIONS__ |
|||
#endif |
|||
|
|||
|
|||
/* Number of bits in a file offset, on hosts where this is settable. */ |
|||
#undef _FILE_OFFSET_BITS |
|||
|
|||
/* Define for large files, on AIX-style hosts. */ |
|||
#undef _LARGE_FILES |
|||
|
|||
/* Define to 1 if on MINIX. */ |
|||
#undef _MINIX |
|||
|
|||
/* Define to 2 if the system does not provide POSIX.1 features except with
|
|||
this defined. */ |
|||
#undef _POSIX_1_SOURCE |
|||
|
|||
/* Define to 1 if you need to in order for `stat' and other things to work. */ |
|||
#undef _POSIX_SOURCE |
File diff suppressed because it is too large
File diff suppressed because it is too large
@ -0,0 +1,368 @@ |
|||
# Helper functions for option handling. -*- Autoconf -*- |
|||
# |
|||
# Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc. |
|||
# Written by Gary V. Vaughan, 2004 |
|||
# |
|||
# This file is free software; the Free Software Foundation gives |
|||
# unlimited permission to copy and/or distribute it, with or without |
|||
# modifications, as long as this notice is preserved. |
|||
|
|||
# serial 6 ltoptions.m4 |
|||
|
|||
# This is to help aclocal find these macros, as it can't see m4_define. |
|||
AC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])]) |
|||
|
|||
|
|||
# _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME) |
|||
# ------------------------------------------ |
|||
m4_define([_LT_MANGLE_OPTION], |
|||
[[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])]) |
|||
|
|||
|
|||
# _LT_SET_OPTION(MACRO-NAME, OPTION-NAME) |
|||
# --------------------------------------- |
|||
# Set option OPTION-NAME for macro MACRO-NAME, and if there is a |
|||
# matching handler defined, dispatch to it. Other OPTION-NAMEs are |
|||
# saved as a flag. |
|||
m4_define([_LT_SET_OPTION], |
|||
[m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl |
|||
m4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]), |
|||
_LT_MANGLE_DEFUN([$1], [$2]), |
|||
[m4_warning([Unknown $1 option `$2'])])[]dnl |
|||
]) |
|||
|
|||
|
|||
# _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET]) |
|||
# ------------------------------------------------------------ |
|||
# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. |
|||
m4_define([_LT_IF_OPTION], |
|||
[m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])]) |
|||
|
|||
|
|||
# _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET) |
|||
# ------------------------------------------------------- |
|||
# Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME |
|||
# are set. |
|||
m4_define([_LT_UNLESS_OPTIONS], |
|||
[m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), |
|||
[m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option), |
|||
[m4_define([$0_found])])])[]dnl |
|||
m4_ifdef([$0_found], [m4_undefine([$0_found])], [$3 |
|||
])[]dnl |
|||
]) |
|||
|
|||
|
|||
# _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST) |
|||
# ---------------------------------------- |
|||
# OPTION-LIST is a space-separated list of Libtool options associated |
|||
# with MACRO-NAME. If any OPTION has a matching handler declared with |
|||
# LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about |
|||
# the unknown option and exit. |
|||
m4_defun([_LT_SET_OPTIONS], |
|||
[# Set options |
|||
m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), |
|||
[_LT_SET_OPTION([$1], _LT_Option)]) |
|||
|
|||
m4_if([$1],[LT_INIT],[ |
|||
dnl |
|||
dnl Simply set some default values (i.e off) if boolean options were not |
|||
dnl specified: |
|||
_LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no |
|||
]) |
|||
_LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no |
|||
]) |
|||
dnl |
|||
dnl If no reference was made to various pairs of opposing options, then |
|||
dnl we run the default mode handler for the pair. For example, if neither |
|||
dnl `shared' nor `disable-shared' was passed, we enable building of shared |
|||
dnl archives by default: |
|||
_LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED]) |
|||
_LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC]) |
|||
_LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC]) |
|||
_LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install], |
|||
[_LT_ENABLE_FAST_INSTALL]) |
|||
]) |
|||
])# _LT_SET_OPTIONS |
|||
|
|||
|
|||
## --------------------------------- ## |
|||
## Macros to handle LT_INIT options. ## |
|||
## --------------------------------- ## |
|||
|
|||
# _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME) |
|||
# ----------------------------------------- |
|||
m4_define([_LT_MANGLE_DEFUN], |
|||
[[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])]) |
|||
|
|||
|
|||
# LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE) |
|||
# ----------------------------------------------- |
|||
m4_define([LT_OPTION_DEFINE], |
|||
[m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl |
|||
])# LT_OPTION_DEFINE |
|||
|
|||
|
|||
# dlopen |
|||
# ------ |
|||
LT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes |
|||
]) |
|||
|
|||
AU_DEFUN([AC_LIBTOOL_DLOPEN], |
|||
[_LT_SET_OPTION([LT_INIT], [dlopen]) |
|||
AC_DIAGNOSE([obsolete], |
|||
[$0: Remove this warning and the call to _LT_SET_OPTION when you |
|||
put the `dlopen' option into LT_INIT's first parameter.]) |
|||
]) |
|||
|
|||
dnl aclocal-1.4 backwards compatibility: |
|||
dnl AC_DEFUN([AC_LIBTOOL_DLOPEN], []) |
|||
|
|||
|
|||
# win32-dll |
|||
# --------- |
|||
# Declare package support for building win32 dll's. |
|||
LT_OPTION_DEFINE([LT_INIT], [win32-dll], |
|||
[enable_win32_dll=yes |
|||
|
|||
case $host in |
|||
*-*-cygwin* | *-*-mingw* | *-*-pw32*) |
|||
AC_CHECK_TOOL(AS, as, false) |
|||
AC_CHECK_TOOL(DLLTOOL, dlltool, false) |
|||
AC_CHECK_TOOL(OBJDUMP, objdump, false) |
|||
;; |
|||
esac |
|||
|
|||
test -z "$AS" && AS=as |
|||
_LT_DECL([], [AS], [0], [Assembler program])dnl |
|||
|
|||
test -z "$DLLTOOL" && DLLTOOL=dlltool |
|||
_LT_DECL([], [DLLTOOL], [0], [DLL creation program])dnl |
|||
|
|||
test -z "$OBJDUMP" && OBJDUMP=objdump |
|||
_LT_DECL([], [OBJDUMP], [0], [Object dumper program])dnl |
|||
])# win32-dll |
|||
|
|||
AU_DEFUN([AC_LIBTOOL_WIN32_DLL], |
|||
[AC_REQUIRE([AC_CANONICAL_HOST])dnl |
|||
_LT_SET_OPTION([LT_INIT], [win32-dll]) |
|||
AC_DIAGNOSE([obsolete], |
|||
[$0: Remove this warning and the call to _LT_SET_OPTION when you |
|||
put the `win32-dll' option into LT_INIT's first parameter.]) |
|||
]) |
|||
|
|||
dnl aclocal-1.4 backwards compatibility: |
|||
dnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], []) |
|||
|
|||
|
|||
# _LT_ENABLE_SHARED([DEFAULT]) |
|||
# ---------------------------- |
|||
# implement the --enable-shared flag, and supports the `shared' and |
|||
# `disable-shared' LT_INIT options. |
|||
# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. |
|||
m4_define([_LT_ENABLE_SHARED], |
|||
[m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl |
|||
AC_ARG_ENABLE([shared], |
|||
[AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@], |
|||
[build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])], |
|||
[p=${PACKAGE-default} |
|||
case $enableval in |
|||
yes) enable_shared=yes ;; |
|||
no) enable_shared=no ;; |
|||
*) |
|||
enable_shared=no |
|||
# Look at the argument we got. We use all the common list separators. |
|||
lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," |
|||
for pkg in $enableval; do |
|||
IFS="$lt_save_ifs" |
|||
if test "X$pkg" = "X$p"; then |
|||
enable_shared=yes |
|||
fi |
|||
done |
|||
IFS="$lt_save_ifs" |
|||
;; |
|||
esac], |
|||
[enable_shared=]_LT_ENABLE_SHARED_DEFAULT) |
|||
|
|||
_LT_DECL([build_libtool_libs], [enable_shared], [0], |
|||
[Whether or not to build shared libraries]) |
|||
])# _LT_ENABLE_SHARED |
|||
|
|||
LT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])]) |
|||
LT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])]) |
|||
|
|||
# Old names: |
|||
AC_DEFUN([AC_ENABLE_SHARED], |
|||
[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared]) |
|||
]) |
|||
|
|||
AC_DEFUN([AC_DISABLE_SHARED], |
|||
[_LT_SET_OPTION([LT_INIT], [disable-shared]) |
|||
]) |
|||
|
|||
AU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)]) |
|||
AU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)]) |
|||
|
|||
dnl aclocal-1.4 backwards compatibility: |
|||
dnl AC_DEFUN([AM_ENABLE_SHARED], []) |
|||
dnl AC_DEFUN([AM_DISABLE_SHARED], []) |
|||
|
|||
|
|||
|
|||
# _LT_ENABLE_STATIC([DEFAULT]) |
|||
# ---------------------------- |
|||
# implement the --enable-static flag, and support the `static' and |
|||
# `disable-static' LT_INIT options. |
|||
# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. |
|||
m4_define([_LT_ENABLE_STATIC], |
|||
[m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl |
|||
AC_ARG_ENABLE([static], |
|||
[AS_HELP_STRING([--enable-static@<:@=PKGS@:>@], |
|||
[build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])], |
|||
[p=${PACKAGE-default} |
|||
case $enableval in |
|||
yes) enable_static=yes ;; |
|||
no) enable_static=no ;; |
|||
*) |
|||
enable_static=no |
|||
# Look at the argument we got. We use all the common list separators. |
|||
lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," |
|||
for pkg in $enableval; do |
|||
IFS="$lt_save_ifs" |
|||
if test "X$pkg" = "X$p"; then |
|||
enable_static=yes |
|||
fi |
|||
done |
|||
IFS="$lt_save_ifs" |
|||
;; |
|||
esac], |
|||
[enable_static=]_LT_ENABLE_STATIC_DEFAULT) |
|||
|
|||
_LT_DECL([build_old_libs], [enable_static], [0], |
|||
[Whether or not to build static libraries]) |
|||
])# _LT_ENABLE_STATIC |
|||
|
|||
LT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])]) |
|||
LT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])]) |
|||
|
|||
# Old names: |
|||
AC_DEFUN([AC_ENABLE_STATIC], |
|||
[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static]) |
|||
]) |
|||
|
|||
AC_DEFUN([AC_DISABLE_STATIC], |
|||
[_LT_SET_OPTION([LT_INIT], [disable-static]) |
|||
]) |
|||
|
|||
AU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)]) |
|||
AU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)]) |
|||
|
|||
dnl aclocal-1.4 backwards compatibility: |
|||
dnl AC_DEFUN([AM_ENABLE_STATIC], []) |
|||
dnl AC_DEFUN([AM_DISABLE_STATIC], []) |
|||
|
|||
|
|||
|
|||
# _LT_ENABLE_FAST_INSTALL([DEFAULT]) |
|||
# ---------------------------------- |
|||
# implement the --enable-fast-install flag, and support the `fast-install' |
|||
# and `disable-fast-install' LT_INIT options. |
|||
# DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. |
|||
m4_define([_LT_ENABLE_FAST_INSTALL], |
|||
[m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl |
|||
AC_ARG_ENABLE([fast-install], |
|||
[AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@], |
|||
[optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])], |
|||
[p=${PACKAGE-default} |
|||
case $enableval in |
|||
yes) enable_fast_install=yes ;; |
|||
no) enable_fast_install=no ;; |
|||
*) |
|||
enable_fast_install=no |
|||
# Look at the argument we got. We use all the common list separators. |
|||
lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," |
|||
for pkg in $enableval; do |
|||
IFS="$lt_save_ifs" |
|||
if test "X$pkg" = "X$p"; then |
|||
enable_fast_install=yes |
|||
fi |
|||
done |
|||
IFS="$lt_save_ifs" |
|||
;; |
|||
esac], |
|||
[enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT) |
|||
|
|||
_LT_DECL([fast_install], [enable_fast_install], [0], |
|||
[Whether or not to optimize for fast installation])dnl |
|||
])# _LT_ENABLE_FAST_INSTALL |
|||
|
|||
LT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])]) |
|||
LT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])]) |
|||
|
|||
# Old names: |
|||
AU_DEFUN([AC_ENABLE_FAST_INSTALL], |
|||
[_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install]) |
|||
AC_DIAGNOSE([obsolete], |
|||
[$0: Remove this warning and the call to _LT_SET_OPTION when you put |
|||
the `fast-install' option into LT_INIT's first parameter.]) |
|||
]) |
|||
|
|||
AU_DEFUN([AC_DISABLE_FAST_INSTALL], |
|||
[_LT_SET_OPTION([LT_INIT], [disable-fast-install]) |
|||
AC_DIAGNOSE([obsolete], |
|||
[$0: Remove this warning and the call to _LT_SET_OPTION when you put |
|||
the `disable-fast-install' option into LT_INIT's first parameter.]) |
|||
]) |
|||
|
|||
dnl aclocal-1.4 backwards compatibility: |
|||
dnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], []) |
|||
dnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], []) |
|||
|
|||
|
|||
# _LT_WITH_PIC([MODE]) |
|||
# -------------------- |
|||
# implement the --with-pic flag, and support the `pic-only' and `no-pic' |
|||
# LT_INIT options. |
|||
# MODE is either `yes' or `no'. If omitted, it defaults to `both'. |
|||
m4_define([_LT_WITH_PIC], |
|||
[AC_ARG_WITH([pic], |
|||
[AS_HELP_STRING([--with-pic], |
|||
[try to use only PIC/non-PIC objects @<:@default=use both@:>@])], |
|||
[pic_mode="$withval"], |
|||
[pic_mode=default]) |
|||
|
|||
test -z "$pic_mode" && pic_mode=m4_default([$1], [default]) |
|||
|
|||
_LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl |
|||
])# _LT_WITH_PIC |
|||
|
|||
LT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])]) |
|||
LT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])]) |
|||
|
|||
# Old name: |
|||
AU_DEFUN([AC_LIBTOOL_PICMODE], |
|||
[_LT_SET_OPTION([LT_INIT], [pic-only]) |
|||
AC_DIAGNOSE([obsolete], |
|||
[$0: Remove this warning and the call to _LT_SET_OPTION when you |
|||
put the `pic-only' option into LT_INIT's first parameter.]) |
|||
]) |
|||
|
|||
dnl aclocal-1.4 backwards compatibility: |
|||
dnl AC_DEFUN([AC_LIBTOOL_PICMODE], []) |
|||
|
|||
## ----------------- ## |
|||
## LTDL_INIT Options ## |
|||
## ----------------- ## |
|||
|
|||
m4_define([_LTDL_MODE], []) |
|||
LT_OPTION_DEFINE([LTDL_INIT], [nonrecursive], |
|||
[m4_define([_LTDL_MODE], [nonrecursive])]) |
|||
LT_OPTION_DEFINE([LTDL_INIT], [recursive], |
|||
[m4_define([_LTDL_MODE], [recursive])]) |
|||
LT_OPTION_DEFINE([LTDL_INIT], [subproject], |
|||
[m4_define([_LTDL_MODE], [subproject])]) |
|||
|
|||
m4_define([_LTDL_TYPE], []) |
|||
LT_OPTION_DEFINE([LTDL_INIT], [installable], |
|||
[m4_define([_LTDL_TYPE], [installable])]) |
|||
LT_OPTION_DEFINE([LTDL_INIT], [convenience], |
|||
[m4_define([_LTDL_TYPE], [convenience])]) |
@ -0,0 +1,123 @@ |
|||
# ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*- |
|||
# |
|||
# Copyright (C) 2004, 2005, 2007 Free Software Foundation, Inc. |
|||
# Written by Gary V. Vaughan, 2004 |
|||
# |
|||
# This file is free software; the Free Software Foundation gives |
|||
# unlimited permission to copy and/or distribute it, with or without |
|||
# modifications, as long as this notice is preserved. |
|||
|
|||
# serial 5 ltsugar.m4 |
|||
|
|||
# This is to help aclocal find these macros, as it can't see m4_define. |
|||
AC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])]) |
|||
|
|||
|
|||
# lt_join(SEP, ARG1, [ARG2...]) |
|||
# ----------------------------- |
|||
# Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their |
|||
# associated separator. |
|||
# Needed until we can rely on m4_join from Autoconf 2.62, since all earlier |
|||
# versions in m4sugar had bugs. |
|||
m4_define([lt_join], |
|||
[m4_if([$#], [1], [], |
|||
[$#], [2], [[$2]], |
|||
[m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])]) |
|||
m4_define([_lt_join], |
|||
[m4_if([$#$2], [2], [], |
|||
[m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])]) |
|||
|
|||
|
|||
# lt_car(LIST) |
|||
# lt_cdr(LIST) |
|||
# ------------ |
|||
# Manipulate m4 lists. |
|||
# These macros are necessary as long as will still need to support |
|||
# Autoconf-2.59 which quotes differently. |
|||
m4_define([lt_car], [[$1]]) |
|||
m4_define([lt_cdr], |
|||
[m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])], |
|||
[$#], 1, [], |
|||
[m4_dquote(m4_shift($@))])]) |
|||
m4_define([lt_unquote], $1) |
|||
|
|||
|
|||
# lt_append(MACRO-NAME, STRING, [SEPARATOR]) |
|||
# ------------------------------------------ |
|||
# Redefine MACRO-NAME to hold its former content plus `SEPARATOR'`STRING'. |
|||
# Note that neither SEPARATOR nor STRING are expanded; they are appended |
|||
# to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked). |
|||
# No SEPARATOR is output if MACRO-NAME was previously undefined (different |
|||
# than defined and empty). |
|||
# |
|||
# This macro is needed until we can rely on Autoconf 2.62, since earlier |
|||
# versions of m4sugar mistakenly expanded SEPARATOR but not STRING. |
|||
m4_define([lt_append], |
|||
[m4_define([$1], |
|||
m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])]) |
|||
|
|||
|
|||
|
|||
# lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...]) |
|||
# ---------------------------------------------------------- |
|||
# Produce a SEP delimited list of all paired combinations of elements of |
|||
# PREFIX-LIST with SUFFIX1 through SUFFIXn. Each element of the list |
|||
# has the form PREFIXmINFIXSUFFIXn. |
|||
m4_define([lt_combine], |
|||
[m4_if([$2], [], [], |
|||
[m4_if([$4], [], [], |
|||
[lt_join(m4_quote(m4_default([$1], [[, ]])), |
|||
lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_prefix, [$2], |
|||
[m4_foreach(_Lt_suffix, lt_car([m4_shiftn(3, $@)]), |
|||
[_Lt_prefix[]$3[]_Lt_suffix ])])))))])])dnl |
|||
]) |
|||
|
|||
|
|||
# lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ]) |
|||
# ----------------------------------------------------------------------- |
|||
# Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited |
|||
# by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ. |
|||
m4_define([lt_if_append_uniq], |
|||
[m4_ifdef([$1], |
|||
[m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1], |
|||
[lt_append([$1], [$2], [$3])$4], |
|||
[$5])], |
|||
[lt_append([$1], [$2], [$3])$4])]) |
|||
|
|||
|
|||
# lt_dict_add(DICT, KEY, VALUE) |
|||
# ----------------------------- |
|||
m4_define([lt_dict_add], |
|||
[m4_define([$1($2)], [$3])]) |
|||
|
|||
|
|||
# lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE) |
|||
# -------------------------------------------- |
|||
m4_define([lt_dict_add_subkey], |
|||
[m4_define([$1($2:$3)], [$4])]) |
|||
|
|||
|
|||
# lt_dict_fetch(DICT, KEY, [SUBKEY]) |
|||
# ---------------------------------- |
|||
m4_define([lt_dict_fetch], |
|||
[m4_ifval([$3], |
|||
m4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]), |
|||
m4_ifdef([$1($2)], [m4_defn([$1($2)])]))]) |
|||
|
|||
|
|||
# lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE]) |
|||
# ----------------------------------------------------------------- |
|||
m4_define([lt_if_dict_fetch], |
|||
[m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4], |
|||
[$5], |
|||
[$6])]) |
|||
|
|||
|
|||
# lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...]) |
|||
# -------------------------------------------------------------- |
|||
m4_define([lt_dict_filter], |
|||
[m4_if([$5], [], [], |
|||
[lt_join(m4_quote(m4_default([$4], [[, ]])), |
|||
lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]), |
|||
[lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl |
|||
]) |
@ -0,0 +1,23 @@ |
|||
# ltversion.m4 -- version numbers -*- Autoconf -*- |
|||
# |
|||
# Copyright (C) 2004 Free Software Foundation, Inc. |
|||
# Written by Scott James Remnant, 2004 |
|||
# |
|||
# This file is free software; the Free Software Foundation gives |
|||
# unlimited permission to copy and/or distribute it, with or without |
|||
# modifications, as long as this notice is preserved. |
|||
|
|||
# Generated from ltversion.in. |
|||
|
|||
# serial 2976 ltversion.m4 |
|||
# This file is part of GNU Libtool |
|||
|
|||
m4_define([LT_PACKAGE_VERSION], [2.2.4]) |
|||
m4_define([LT_PACKAGE_REVISION], [1.2976]) |
|||
|
|||
AC_DEFUN([LTVERSION_VERSION], |
|||
[macro_version='2.2.4' |
|||
macro_revision='1.2976' |
|||
_LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?]) |
|||
_LT_DECL(, macro_revision, 0) |
|||
]) |
@ -0,0 +1,92 @@ |
|||
# lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*- |
|||
# |
|||
# Copyright (C) 2004, 2005, 2007 Free Software Foundation, Inc. |
|||
# Written by Scott James Remnant, 2004. |
|||
# |
|||
# This file is free software; the Free Software Foundation gives |
|||
# unlimited permission to copy and/or distribute it, with or without |
|||
# modifications, as long as this notice is preserved. |
|||
|
|||
# serial 4 lt~obsolete.m4 |
|||
|
|||
# These exist entirely to fool aclocal when bootstrapping libtool. |
|||
# |
|||
# In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN) |
|||
# which have later been changed to m4_define as they aren't part of the |
|||
# exported API, or moved to Autoconf or Automake where they belong. |
|||
# |
|||
# The trouble is, aclocal is a bit thick. It'll see the old AC_DEFUN |
|||
# in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us |
|||
# using a macro with the same name in our local m4/libtool.m4 it'll |
|||
# pull the old libtool.m4 in (it doesn't see our shiny new m4_define |
|||
# and doesn't know about Autoconf macros at all.) |
|||
# |
|||
# So we provide this file, which has a silly filename so it's always |
|||
# included after everything else. This provides aclocal with the |
|||
# AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything |
|||
# because those macros already exist, or will be overwritten later. |
|||
# We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6. |
|||
# |
|||
# Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here. |
|||
# Yes, that means every name once taken will need to remain here until |
|||
# we give up compatibility with versions before 1.7, at which point |
|||
# we need to keep only those names which we still refer to. |
|||
|
|||
# This is to help aclocal find these macros, as it can't see m4_define. |
|||
AC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])]) |
|||
|
|||
m4_ifndef([AC_LIBTOOL_LINKER_OPTION], [AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])]) |
|||
m4_ifndef([AC_PROG_EGREP], [AC_DEFUN([AC_PROG_EGREP])]) |
|||
m4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])]) |
|||
m4_ifndef([_LT_AC_SHELL_INIT], [AC_DEFUN([_LT_AC_SHELL_INIT])]) |
|||
m4_ifndef([_LT_AC_SYS_LIBPATH_AIX], [AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])]) |
|||
m4_ifndef([_LT_PROG_LTMAIN], [AC_DEFUN([_LT_PROG_LTMAIN])]) |
|||
m4_ifndef([_LT_AC_TAGVAR], [AC_DEFUN([_LT_AC_TAGVAR])]) |
|||
m4_ifndef([AC_LTDL_ENABLE_INSTALL], [AC_DEFUN([AC_LTDL_ENABLE_INSTALL])]) |
|||
m4_ifndef([AC_LTDL_PREOPEN], [AC_DEFUN([AC_LTDL_PREOPEN])]) |
|||
m4_ifndef([_LT_AC_SYS_COMPILER], [AC_DEFUN([_LT_AC_SYS_COMPILER])]) |
|||
m4_ifndef([_LT_AC_LOCK], [AC_DEFUN([_LT_AC_LOCK])]) |
|||
m4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE], [AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])]) |
|||
m4_ifndef([_LT_AC_TRY_DLOPEN_SELF], [AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])]) |
|||
m4_ifndef([AC_LIBTOOL_PROG_CC_C_O], [AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])]) |
|||
m4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])]) |
|||
m4_ifndef([AC_LIBTOOL_OBJDIR], [AC_DEFUN([AC_LIBTOOL_OBJDIR])]) |
|||
m4_ifndef([AC_LTDL_OBJDIR], [AC_DEFUN([AC_LTDL_OBJDIR])]) |
|||
m4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])]) |
|||
m4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP], [AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])]) |
|||
m4_ifndef([AC_PATH_MAGIC], [AC_DEFUN([AC_PATH_MAGIC])]) |
|||
m4_ifndef([AC_PROG_LD_GNU], [AC_DEFUN([AC_PROG_LD_GNU])]) |
|||
m4_ifndef([AC_PROG_LD_RELOAD_FLAG], [AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])]) |
|||
m4_ifndef([AC_DEPLIBS_CHECK_METHOD], [AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])]) |
|||
m4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])]) |
|||
m4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])]) |
|||
m4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])]) |
|||
m4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS], [AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])]) |
|||
m4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP], [AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])]) |
|||
m4_ifndef([LT_AC_PROG_EGREP], [AC_DEFUN([LT_AC_PROG_EGREP])]) |
|||
m4_ifndef([LT_AC_PROG_SED], [AC_DEFUN([LT_AC_PROG_SED])]) |
|||
m4_ifndef([_LT_CC_BASENAME], [AC_DEFUN([_LT_CC_BASENAME])]) |
|||
m4_ifndef([_LT_COMPILER_BOILERPLATE], [AC_DEFUN([_LT_COMPILER_BOILERPLATE])]) |
|||
m4_ifndef([_LT_LINKER_BOILERPLATE], [AC_DEFUN([_LT_LINKER_BOILERPLATE])]) |
|||
m4_ifndef([_AC_PROG_LIBTOOL], [AC_DEFUN([_AC_PROG_LIBTOOL])]) |
|||
m4_ifndef([AC_LIBTOOL_SETUP], [AC_DEFUN([AC_LIBTOOL_SETUP])]) |
|||
m4_ifndef([_LT_AC_CHECK_DLFCN], [AC_DEFUN([_LT_AC_CHECK_DLFCN])]) |
|||
m4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER], [AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])]) |
|||
m4_ifndef([_LT_AC_TAGCONFIG], [AC_DEFUN([_LT_AC_TAGCONFIG])]) |
|||
m4_ifndef([AC_DISABLE_FAST_INSTALL], [AC_DEFUN([AC_DISABLE_FAST_INSTALL])]) |
|||
m4_ifndef([_LT_AC_LANG_CXX], [AC_DEFUN([_LT_AC_LANG_CXX])]) |
|||
m4_ifndef([_LT_AC_LANG_F77], [AC_DEFUN([_LT_AC_LANG_F77])]) |
|||
m4_ifndef([_LT_AC_LANG_GCJ], [AC_DEFUN([_LT_AC_LANG_GCJ])]) |
|||
m4_ifndef([AC_LIBTOOL_RC], [AC_DEFUN([AC_LIBTOOL_RC])]) |
|||
m4_ifndef([AC_LIBTOOL_LANG_C_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])]) |
|||
m4_ifndef([_LT_AC_LANG_C_CONFIG], [AC_DEFUN([_LT_AC_LANG_C_CONFIG])]) |
|||
m4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])]) |
|||
m4_ifndef([_LT_AC_LANG_CXX_CONFIG], [AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])]) |
|||
m4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])]) |
|||
m4_ifndef([_LT_AC_LANG_F77_CONFIG], [AC_DEFUN([_LT_AC_LANG_F77_CONFIG])]) |
|||
m4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])]) |
|||
m4_ifndef([_LT_AC_LANG_GCJ_CONFIG], [AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])]) |
|||
m4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])]) |
|||
m4_ifndef([_LT_AC_LANG_RC_CONFIG], [AC_DEFUN([_LT_AC_LANG_RC_CONFIG])]) |
|||
m4_ifndef([AC_LIBTOOL_CONFIG], [AC_DEFUN([AC_LIBTOOL_CONFIG])]) |
|||
m4_ifndef([_LT_AC_FILE_LTDLL_C], [AC_DEFUN([_LT_AC_FILE_LTDLL_C])]) |
File diff suppressed because it is too large
@ -0,0 +1,503 @@ |
|||
# configure.ac -- Backtrace configure script. |
|||
# Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
|
|||
# Redistribution and use in source and binary forms, with or without |
|||
# modification, are permitted provided that the following conditions are |
|||
# met: |
|||
|
|||
# (1) Redistributions of source code must retain the above copyright |
|||
# notice, this list of conditions and the following disclaimer. |
|||
|
|||
# (2) Redistributions in binary form must reproduce the above copyright |
|||
# notice, this list of conditions and the following disclaimer in |
|||
# the documentation and/or other materials provided with the |
|||
# distribution. |
|||
|
|||
# (3) The name of the author may not be used to |
|||
# endorse or promote products derived from this software without |
|||
# specific prior written permission. |
|||
|
|||
# THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
# IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
# DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
# INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
# SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
# STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
# IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
# POSSIBILITY OF SUCH DAMAGE. |
|||
|
|||
AC_PREREQ(2.64) |
|||
AC_INIT(package-unused, version-unused,, libbacktrace) |
|||
AC_CONFIG_SRCDIR(backtrace.h) |
|||
AC_CONFIG_HEADER(config.h) |
|||
AC_CONFIG_MACRO_DIR(config) |
|||
|
|||
# with_target_subdir is used when configured as part of a GCC tree. |
|||
if test -n "${with_target_subdir}"; then |
|||
AM_ENABLE_MULTILIB(, ..) |
|||
fi |
|||
|
|||
AC_CANONICAL_SYSTEM |
|||
target_alias=${target_alias-$host_alias} |
|||
|
|||
AC_USE_SYSTEM_EXTENSIONS |
|||
|
|||
libtool_VERSION=1:0:0 |
|||
AC_SUBST(libtool_VERSION) |
|||
|
|||
# 1.11.1: Require that version of automake. |
|||
# foreign: Don't require README, INSTALL, NEWS, etc. |
|||
# no-define: Don't define PACKAGE and VERSION. |
|||
# no-dependencies: Don't generate automatic dependencies. |
|||
# (because it breaks when using bootstrap-lean, since some of the |
|||
# headers are gone at "make install" time). |
|||
# -Wall: Issue all automake warnings. |
|||
# -Wno-portability: Don't warn about constructs supported by GNU make. |
|||
# (because GCC requires GNU make anyhow). |
|||
AM_INIT_AUTOMAKE([1.11.1 foreign no-dist no-define no-dependencies -Wall -Wno-portability]) |
|||
|
|||
AM_MAINTAINER_MODE |
|||
|
|||
AC_ARG_WITH(target-subdir, |
|||
[ --with-target-subdir=SUBDIR Configuring in a subdirectory for target]) |
|||
|
|||
# We must force CC to /not/ be precious variables; otherwise |
|||
# the wrong, non-multilib-adjusted value will be used in multilibs. |
|||
# As a side effect, we have to subst CFLAGS ourselves. |
|||
m4_rename([_AC_ARG_VAR_PRECIOUS],[backtrace_PRECIOUS]) |
|||
m4_define([_AC_ARG_VAR_PRECIOUS],[]) |
|||
AC_PROG_CC |
|||
m4_rename_force([backtrace_PRECIOUS],[_AC_ARG_VAR_PRECIOUS]) |
|||
|
|||
AC_SUBST(CFLAGS) |
|||
|
|||
AC_PROG_AWK |
|||
case "$AWK" in |
|||
"") AC_MSG_ERROR([can't build without awk]) ;; |
|||
esac |
|||
|
|||
LT_INIT |
|||
AM_PROG_LIBTOOL |
|||
|
|||
AC_SYS_LARGEFILE |
|||
|
|||
backtrace_supported=yes |
|||
|
|||
if test -n "${with_target_subdir}"; then |
|||
# We are compiling a GCC library. We can assume that the unwind |
|||
# library exists. |
|||
BACKTRACE_FILE="backtrace.lo simple.lo" |
|||
else |
|||
AC_CHECK_HEADER([unwind.h], |
|||
[AC_CHECK_FUNC([_Unwind_Backtrace], |
|||
[BACKTRACE_FILE="backtrace.lo simple.lo"], |
|||
[BACKTRACE_FILE="nounwind.lo" |
|||
backtrace_supported=no])], |
|||
[BACKTRACE_FILE="nounwind.lo" |
|||
backtrace_supported=no]) |
|||
fi |
|||
AC_SUBST(BACKTRACE_FILE) |
|||
|
|||
EXTRA_FLAGS= |
|||
if test -n "${with_target_subdir}"; then |
|||
EXTRA_FLAGS="-funwind-tables -frandom-seed=\$@" |
|||
else |
|||
AC_CACHE_CHECK([for -funwind-tables option], |
|||
[libbacktrace_cv_c_unwind_tables], |
|||
[CFLAGS_hold="$CFLAGS" |
|||
CFLAGS="$CFLAGS -funwind-tables" |
|||
AC_COMPILE_IFELSE( |
|||
[AC_LANG_PROGRAM([static int f() { return 0; }], [return f();])], |
|||
[libbacktrace_cv_c_unwind_tables=yes], |
|||
[libbacktrace_cv_c_unwind_tables=no]) |
|||
CFLAGS="$CFLAGS_hold"]) |
|||
if test "$libbacktrace_cv_c_unwind_tables" = "yes"; then |
|||
EXTRA_FLAGS=-funwind-tables |
|||
fi |
|||
AC_CACHE_CHECK([for -frandom-seed=string option], |
|||
[libbacktrace_cv_c_random_seed_string], |
|||
[CFLAGS_hold="$CFLAGS" |
|||
CFLAGS="$CFLAGS -frandom-seed=conftest.lo" |
|||
AC_COMPILE_IFELSE( |
|||
[AC_LANG_PROGRAM([], [return 0;])], |
|||
[libbacktrace_cv_c_random_seed_string=yes], |
|||
[libbacktrace_cv_c_random_seed_string=no]) |
|||
CFLAGS="$CFLAGS_hold"]) |
|||
if test "$libbacktrace_cv_c_random_seed_string" = "yes"; then |
|||
EXTRA_FLAGS="$EXTRA_FLAGS -frandom-seed=\$@" |
|||
fi |
|||
fi |
|||
AC_SUBST(EXTRA_FLAGS) |
|||
|
|||
ACX_PROG_CC_WARNING_OPTS([-W -Wall -Wwrite-strings -Wstrict-prototypes \ |
|||
-Wmissing-prototypes -Wold-style-definition \ |
|||
-Wmissing-format-attribute -Wcast-qual], |
|||
[WARN_FLAGS]) |
|||
|
|||
if test -n "${with_target_subdir}"; then |
|||
WARN_FLAGS="$WARN_FLAGS -Werror" |
|||
fi |
|||
|
|||
AC_SUBST(WARN_FLAGS) |
|||
|
|||
if test -n "${with_target_subdir}"; then |
|||
GCC_CHECK_UNWIND_GETIPINFO |
|||
else |
|||
ac_save_CFFLAGS="$CFLAGS" |
|||
CFLAGS="$CFLAGS -Werror-implicit-function-declaration" |
|||
AC_MSG_CHECKING([for _Unwind_GetIPInfo]) |
|||
AC_LINK_IFELSE( |
|||
[AC_LANG_PROGRAM( |
|||
[#include "unwind.h" |
|||
struct _Unwind_Context *context; |
|||
int ip_before_insn = 0;], |
|||
[return _Unwind_GetIPInfo (context, &ip_before_insn);])], |
|||
[have_unwind_getipinfo=yes], [have_unwind_getipinfo=no]) |
|||
CFLAGS="$ac_save_CFLAGS" |
|||
AC_MSG_RESULT([$have_unwind_getipinfo]) |
|||
if test "$have_unwind_getipinfo" = "yes"; then |
|||
AC_DEFINE(HAVE_GETIPINFO, 1, [Define if _Unwind_GetIPInfo is available.]) |
|||
fi |
|||
fi |
|||
|
|||
# Enable --enable-host-shared. |
|||
AC_ARG_ENABLE(host-shared, |
|||
[AS_HELP_STRING([--enable-host-shared], |
|||
[build host code as shared libraries])], |
|||
[PIC_FLAG=-fPIC], [PIC_FLAG=]) |
|||
AC_SUBST(PIC_FLAG) |
|||
|
|||
# Test for __sync support. |
|||
AC_CACHE_CHECK([__sync extensions], |
|||
[libbacktrace_cv_sys_sync], |
|||
[if test -n "${with_target_subdir}"; then |
|||
case "${host}" in |
|||
hppa*-*-hpux*) libbacktrace_cv_sys_sync=no ;; |
|||
*) libbacktrace_cv_sys_sync=yes ;; |
|||
esac |
|||
else |
|||
AC_LINK_IFELSE( |
|||
[AC_LANG_PROGRAM([int i;], |
|||
[__sync_bool_compare_and_swap (&i, i, i); |
|||
__sync_lock_test_and_set (&i, 1); |
|||
__sync_lock_release (&i);])], |
|||
[libbacktrace_cv_sys_sync=yes], |
|||
[libbacktrace_cv_sys_sync=no]) |
|||
fi]) |
|||
BACKTRACE_SUPPORTS_THREADS=0 |
|||
if test "$libbacktrace_cv_sys_sync" = "yes"; then |
|||
BACKTRACE_SUPPORTS_THREADS=1 |
|||
AC_DEFINE([HAVE_SYNC_FUNCTIONS], 1, |
|||
[Define to 1 if you have the __sync functions]) |
|||
fi |
|||
AC_SUBST(BACKTRACE_SUPPORTS_THREADS) |
|||
|
|||
# Test for __atomic support. |
|||
AC_CACHE_CHECK([__atomic extensions], |
|||
[libbacktrace_cv_sys_atomic], |
|||
[if test -n "${with_target_subdir}"; then |
|||
libbacktrace_cv_sys_atomic=yes |
|||
else |
|||
AC_LINK_IFELSE( |
|||
[AC_LANG_PROGRAM([int i;], |
|||
[__atomic_load_n (&i, __ATOMIC_ACQUIRE); |
|||
__atomic_store_n (&i, 1, __ATOMIC_RELEASE);])], |
|||
[libbacktrace_cv_sys_atomic=yes], |
|||
[libbacktrace_cv_sys_atomic=no]) |
|||
fi]) |
|||
if test "$libbacktrace_cv_sys_atomic" = "yes"; then |
|||
AC_DEFINE([HAVE_ATOMIC_FUNCTIONS], 1, |
|||
[Define to 1 if you have the __atomic functions]) |
|||
fi |
|||
|
|||
# The library needs to be able to read the executable itself. Compile |
|||
# a file to determine the executable format. The awk script |
|||
# filetype.awk prints out the file type. |
|||
AC_CACHE_CHECK([output filetype], |
|||
[libbacktrace_cv_sys_filetype], |
|||
[filetype= |
|||
AC_COMPILE_IFELSE( |
|||
[AC_LANG_PROGRAM([int i;], [int j;])], |
|||
[filetype=`${AWK} -f $srcdir/filetype.awk conftest.$ac_objext`], |
|||
[AC_MSG_FAILURE([compiler failed])]) |
|||
libbacktrace_cv_sys_filetype=$filetype]) |
|||
|
|||
# Match the file type to decide what files to compile. |
|||
FORMAT_FILE= |
|||
backtrace_supports_data=yes |
|||
case "$libbacktrace_cv_sys_filetype" in |
|||
elf*) FORMAT_FILE="elf.lo" ;; |
|||
pecoff) FORMAT_FILE="pecoff.lo" |
|||
backtrace_supports_data=no |
|||
;; |
|||
xcoff*) FORMAT_FILE="xcoff.lo" |
|||
backtrace_supports_data=no |
|||
;; |
|||
*) AC_MSG_WARN([could not determine output file type]) |
|||
FORMAT_FILE="unknown.lo" |
|||
backtrace_supported=no |
|||
;; |
|||
esac |
|||
AC_SUBST(FORMAT_FILE) |
|||
|
|||
# ELF defines. |
|||
elfsize= |
|||
case "$libbacktrace_cv_sys_filetype" in |
|||
elf32) elfsize=32 ;; |
|||
elf64) elfsize=64 ;; |
|||
*) elfsize=unused |
|||
esac |
|||
AC_DEFINE_UNQUOTED([BACKTRACE_ELF_SIZE], [$elfsize], [ELF size: 32 or 64]) |
|||
|
|||
# XCOFF defines. |
|||
xcoffsize= |
|||
case "$libbacktrace_cv_sys_filetype" in |
|||
xcoff32) xcoffsize=32 ;; |
|||
xcoff64) xcoffsize=64 ;; |
|||
*) xcoffsize=unused |
|||
esac |
|||
AC_DEFINE_UNQUOTED([BACKTRACE_XCOFF_SIZE], [$xcoffsize], [XCOFF size: 32 or 64]) |
|||
|
|||
BACKTRACE_SUPPORTED=0 |
|||
if test "$backtrace_supported" = "yes"; then |
|||
BACKTRACE_SUPPORTED=1 |
|||
fi |
|||
AC_SUBST(BACKTRACE_SUPPORTED) |
|||
|
|||
BACKTRACE_SUPPORTS_DATA=0 |
|||
if test "$backtrace_supports_data" = "yes"; then |
|||
BACKTRACE_SUPPORTS_DATA=1 |
|||
fi |
|||
AC_SUBST(BACKTRACE_SUPPORTS_DATA) |
|||
|
|||
AC_CHECK_HEADERS(sys/mman.h) |
|||
if test "$ac_cv_header_sys_mman_h" = "no"; then |
|||
have_mmap=no |
|||
else |
|||
if test -n "${with_target_subdir}"; then |
|||
# When built as a GCC target library, we can't do a link test. We |
|||
# simply assume that if we have mman.h, we have mmap. |
|||
have_mmap=yes |
|||
case "${host}" in |
|||
spu-*-*|*-*-msdosdjgpp) |
|||
# The SPU does not have mmap, but it has a sys/mman.h header file |
|||
# containing "mmap_eaddr" and the mmap flags, confusing the test. |
|||
# DJGPP also has sys/man.h, but no mmap |
|||
have_mmap=no ;; |
|||
esac |
|||
else |
|||
AC_CHECK_FUNC(mmap, [have_mmap=yes], [have_mmap=no]) |
|||
fi |
|||
fi |
|||
if test "$have_mmap" = "no"; then |
|||
VIEW_FILE=read.lo |
|||
ALLOC_FILE=alloc.lo |
|||
else |
|||
VIEW_FILE=mmapio.lo |
|||
AC_PREPROC_IFELSE([ |
|||
#include <sys/mman.h> |
|||
#if !defined(MAP_ANONYMOUS) && !defined(MAP_ANON) |
|||
#error no MAP_ANONYMOUS |
|||
#endif |
|||
], [ALLOC_FILE=mmap.lo], [ALLOC_FILE=alloc.lo]) |
|||
fi |
|||
AC_SUBST(VIEW_FILE) |
|||
AC_SUBST(ALLOC_FILE) |
|||
|
|||
BACKTRACE_USES_MALLOC=0 |
|||
if test "$ALLOC_FILE" = "alloc.lo"; then |
|||
BACKTRACE_USES_MALLOC=1 |
|||
fi |
|||
AC_SUBST(BACKTRACE_USES_MALLOC) |
|||
|
|||
# Check for dl_iterate_phdr. |
|||
AC_CHECK_HEADERS(link.h) |
|||
if test "$ac_cv_header_link_h" = "no"; then |
|||
have_dl_iterate_phdr=no |
|||
else |
|||
if test -n "${with_target_subdir}"; then |
|||
# When built as a GCC target library, we can't do a link test. |
|||
AC_EGREP_HEADER([dl_iterate_phdr], [link.h], [have_dl_iterate_phdr=yes], |
|||
[have_dl_iterate_phdr=no]) |
|||
case "${host}" in |
|||
*-*-solaris2.10*) |
|||
# Avoid dl_iterate_phdr on Solaris 10, where it is in the |
|||
# header file but is only in -ldl. |
|||
have_dl_iterate_phdr=no ;; |
|||
esac |
|||
else |
|||
AC_CHECK_FUNC([dl_iterate_phdr], [have_dl_iterate_phdr=yes], |
|||
[have_dl_iterate_phdr=no]) |
|||
fi |
|||
fi |
|||
if test "$have_dl_iterate_phdr" = "yes"; then |
|||
AC_DEFINE(HAVE_DL_ITERATE_PHDR, 1, [Define if dl_iterate_phdr is available.]) |
|||
fi |
|||
|
|||
# Check for loadquery. |
|||
AC_CHECK_HEADERS(sys/ldr.h) |
|||
if test "$ac_cv_header_sys_ldr_h" = "no"; then |
|||
have_loadquery=no |
|||
else |
|||
if test -n "${with_target_subdir}"; then |
|||
# When built as a GCC target library, we can't do a link test. |
|||
AC_EGREP_HEADER([loadquery], [sys/ldr.h], [have_loadquery=yes], |
|||
[have_loadquery=no]) |
|||
else |
|||
AC_CHECK_FUNC([loadquery], [have_loadquery=yes], |
|||
[have_loadquery=no]) |
|||
fi |
|||
fi |
|||
if test "$have_loadquery" = "yes"; then |
|||
AC_DEFINE(HAVE_LOADQUERY, 1, [Define if AIX loadquery is available.]) |
|||
fi |
|||
|
|||
# Check for the fcntl function. |
|||
if test -n "${with_target_subdir}"; then |
|||
case "${host}" in |
|||
*-*-mingw*) have_fcntl=no ;; |
|||
spu-*-*) have_fcntl=no ;; |
|||
*) have_fcntl=yes ;; |
|||
esac |
|||
else |
|||
AC_CHECK_FUNC(fcntl, [have_fcntl=yes], [have_fcntl=no]) |
|||
fi |
|||
if test "$have_fcntl" = "yes"; then |
|||
AC_DEFINE([HAVE_FCNTL], 1, |
|||
[Define to 1 if you have the fcntl function]) |
|||
fi |
|||
|
|||
AC_CHECK_DECLS(strnlen) |
|||
AC_CHECK_FUNCS(lstat readlink) |
|||
|
|||
# Check for getexecname function. |
|||
if test -n "${with_target_subdir}"; then |
|||
case "${host}" in |
|||
*-*-solaris2*) have_getexecname=yes ;; |
|||
*) have_getexecname=no ;; |
|||
esac |
|||
else |
|||
AC_CHECK_FUNC(getexecname, [have_getexecname=yes], [have_getexecname=no]) |
|||
fi |
|||
if test "$have_getexecname" = "yes"; then |
|||
AC_DEFINE(HAVE_GETEXECNAME, 1, [Define if getexecname is available.]) |
|||
fi |
|||
|
|||
# Check for the clock_gettime function. |
|||
AC_CHECK_FUNCS(clock_gettime) |
|||
clock_gettime_link= |
|||
# At least for glibc, clock_gettime is in librt. But don't |
|||
# pull that in if it still doesn't give us the function we want. This |
|||
# test is copied from libgomp, and modified to not link in -lrt as |
|||
# we're using this for test timing only. |
|||
if test "$ac_cv_func_clock_gettime" = no; then |
|||
AC_CHECK_LIB(rt, clock_gettime, |
|||
[CLOCK_GETTIME_LINK=-lrt |
|||
AC_DEFINE(HAVE_CLOCK_GETTIME, 1, |
|||
[Define to 1 if you have the `clock_gettime' function.])]) |
|||
fi |
|||
AC_SUBST(CLOCK_GETTIME_LINK) |
|||
|
|||
dnl Test whether the compiler supports the -pthread option. |
|||
AC_CACHE_CHECK([whether -pthread is supported], |
|||
[libgo_cv_lib_pthread], |
|||
[CFLAGS_hold=$CFLAGS |
|||
CFLAGS="$CFLAGS -pthread" |
|||
AC_COMPILE_IFELSE([[int i;]], |
|||
[libgo_cv_lib_pthread=yes], |
|||
[libgo_cv_lib_pthread=no]) |
|||
CFLAGS=$CFLAGS_hold]) |
|||
PTHREAD_CFLAGS= |
|||
if test "$libgo_cv_lib_pthread" = yes; then |
|||
PTHREAD_CFLAGS=-pthread |
|||
fi |
|||
AC_SUBST(PTHREAD_CFLAGS) |
|||
|
|||
AM_CONDITIONAL(HAVE_PTHREAD, test "$libgo_cv_lib_pthread" = yes) |
|||
|
|||
AC_CHECK_LIB([z], [compress], []) |
|||
if test $ac_cv_lib_z_compress = "yes"; then |
|||
AC_DEFINE(HAVE_ZLIB, 1, [Define if -lz is available.]) |
|||
fi |
|||
AM_CONDITIONAL(HAVE_ZLIB, test "$ac_cv_lib_z_compress" = yes) |
|||
|
|||
dnl Test whether the linker supports the --compress_debug_sections option. |
|||
AC_CACHE_CHECK([whether --compress-debug-sections is supported], |
|||
[libgo_cv_ld_compress], |
|||
[LDFLAGS_hold=$LDFLAGS |
|||
LDFLAGS="$LDFLAGS -Wl,--compress-debug-sections=zlib-gnu" |
|||
AC_LINK_IFELSE([AC_LANG_PROGRAM(,)], |
|||
[libgo_cv_ld_compress=yes], |
|||
[libgo_cv_ld_compress=no]) |
|||
LDFLAGS=$LDFLAGS_hold]) |
|||
AM_CONDITIONAL(HAVE_COMPRESSED_DEBUG, test "$libgo_cv_ld_compress" = yes) |
|||
|
|||
AC_ARG_VAR(OBJCOPY, [location of objcopy]) |
|||
AC_CHECK_PROG(OBJCOPY, objcopy, objcopy,) |
|||
AC_CACHE_CHECK([whether objcopy supports debuglink], |
|||
[libbacktrace_cv_objcopy_debuglink], |
|||
[if test -n "${with_target_subdir}"; then |
|||
libbacktrace_cv_objcopy_debuglink=no |
|||
elif ${OBJCOPY} --add-gnu-debuglink=x /bin/ls /tmp/ls$$; then |
|||
rm -f /tmp/ls$$ |
|||
libbacktrace_cv_objcopy_debuglink=yes |
|||
else |
|||
libbacktrace_cv_objcopy_debuglink=no |
|||
fi]) |
|||
AM_CONDITIONAL(HAVE_OBJCOPY_DEBUGLINK, test "$libbacktrace_cv_objcopy_debuglink" = yes) |
|||
|
|||
AC_CACHE_CHECK([whether tests can run], |
|||
[libbacktrace_cv_sys_native], |
|||
[AC_RUN_IFELSE([AC_LANG_PROGRAM([], [return 0;])], |
|||
[libbacktrace_cv_sys_native=yes], |
|||
[libbacktrace_cv_sys_native=no], |
|||
[libbacktrace_cv_sys_native=no])]) |
|||
AM_CONDITIONAL(NATIVE, test "$libbacktrace_cv_sys_native" = "yes") |
|||
|
|||
if test "${multilib}" = "yes"; then |
|||
multilib_arg="--enable-multilib" |
|||
else |
|||
multilib_arg= |
|||
fi |
|||
|
|||
AC_CONFIG_FILES(Makefile backtrace-supported.h) |
|||
|
|||
# We need multilib support, but only if configuring for the target. |
|||
AC_CONFIG_COMMANDS([default], |
|||
[if test -n "$CONFIG_FILES"; then |
|||
if test -n "${with_target_subdir}"; then |
|||
# Multilibs need MULTISUBDIR defined correctly in certain makefiles so |
|||
# that multilib installs will end up installed in the correct place. |
|||
# The testsuite needs it for multilib-aware ABI baseline files. |
|||
# To work around this not being passed down from config-ml.in -> |
|||
# srcdir/Makefile.am -> srcdir/{src,libsupc++,...}/Makefile.am, manually |
|||
# append it here. Only modify Makefiles that have just been created. |
|||
# |
|||
# Also, get rid of this simulated-VPATH thing that automake does. |
|||
cat > vpsed << \_EOF |
|||
s!`test -f '$<' || echo '$(srcdir)/'`!! |
|||
_EOF |
|||
for i in $SUBDIRS; do |
|||
case $CONFIG_FILES in |
|||
*${i}/Makefile*) |
|||
#echo "Adding MULTISUBDIR to $i/Makefile" |
|||
sed -f vpsed $i/Makefile > tmp |
|||
grep '^MULTISUBDIR =' Makefile >> tmp |
|||
mv tmp $i/Makefile |
|||
;; |
|||
esac |
|||
done |
|||
rm vpsed |
|||
fi |
|||
fi |
|||
], |
|||
[ |
|||
# Variables needed in config.status (file generation) which aren't already |
|||
# passed by autoconf. |
|||
SUBDIRS="$SUBDIRS" |
|||
]) |
|||
|
|||
AC_OUTPUT |
File diff suppressed because it is too large
@ -0,0 +1,121 @@ |
|||
/* edtest.c -- Test for libbacktrace storage allocation stress handling
|
|||
Copyright (C) 2017-2018 Free Software Foundation, Inc. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <assert.h> |
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
#include <sys/types.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "backtrace-supported.h" |
|||
#include "internal.h" |
|||
|
|||
#include "testlib.h" |
|||
|
|||
static int test1 (void) __attribute__ ((noinline, unused)); |
|||
static int test1 (void) __attribute__ ((noinline, unused)); |
|||
extern int f2 (int); |
|||
extern int f3 (int, int); |
|||
|
|||
static int |
|||
test1 (void) |
|||
{ |
|||
/* Returning a value here and elsewhere avoids a tailcall which
|
|||
would mess up the backtrace. */ |
|||
return f2 (__LINE__) + 1; |
|||
} |
|||
|
|||
int |
|||
f3 (int f1line, int f2line) |
|||
{ |
|||
struct info all[20]; |
|||
struct bdata data; |
|||
int f3line; |
|||
int i; |
|||
|
|||
data.all = &all[0]; |
|||
data.index = 0; |
|||
data.max = 20; |
|||
data.failed = 0; |
|||
|
|||
f3line = __LINE__ + 1; |
|||
i = backtrace_full (state, 0, callback_one, error_callback_one, &data); |
|||
|
|||
if (i != 0) |
|||
{ |
|||
fprintf (stderr, "test1: unexpected return value %d\n", i); |
|||
data.failed = 1; |
|||
} |
|||
|
|||
if (data.index < 3) |
|||
{ |
|||
fprintf (stderr, |
|||
"test1: not enough frames; got %zu, expected at least 3\n", |
|||
data.index); |
|||
data.failed = 1; |
|||
} |
|||
|
|||
check ("test1", 0, all, f3line, "f3", "edtest.c", &data.failed); |
|||
check ("test1", 1, all, f2line, "f2", "edtest2_build.c", &data.failed); |
|||
check ("test1", 2, all, f1line, "test1", "edtest.c", &data.failed); |
|||
|
|||
printf ("%s: backtrace_full alloc stress\n", data.failed ? "FAIL" : "PASS"); |
|||
|
|||
if (data.failed) |
|||
++failures; |
|||
|
|||
return failures; |
|||
} |
|||
|
|||
int |
|||
main (int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED) |
|||
{ |
|||
state = backtrace_create_state (argv[0], BACKTRACE_SUPPORTS_THREADS, |
|||
error_callback_create, NULL); |
|||
|
|||
// Grab the storage allocation lock prior to doing anything interesting.
|
|||
// The intent here is to insure that the backtrace_alloc code is forced
|
|||
// to always call mmap() for new memory as opposed to reusing previously
|
|||
// allocated memory from the free list. Doing things this way helps
|
|||
// simulate what you might see in a multithreaded program in which there
|
|||
// are racing calls to the allocator.
|
|||
struct backtrace_state *state_internal = |
|||
(struct backtrace_state *) state; |
|||
state_internal->lock_alloc = 1; |
|||
|
|||
// Kick off the test
|
|||
test1(); |
|||
|
|||
exit (failures > 0 ? EXIT_FAILURE : EXIT_SUCCESS); |
|||
} |
@ -0,0 +1,43 @@ |
|||
/* edtest2.c -- Test for libbacktrace storage allocation stress handling (p2)
|
|||
Copyright (C) 2017-2018 Free Software Foundation, Inc. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
/* This file intentionally written without any #include's
|
|||
*/ |
|||
|
|||
extern int f3(int, int); |
|||
extern int f2(int); |
|||
|
|||
int f2(int x) |
|||
{ |
|||
/* Returning a value here and elsewhere avoids a tailcall which
|
|||
would mess up the backtrace. */ |
|||
return f3(x, __LINE__) + 3; |
|||
} |
File diff suppressed because it is too large
@ -0,0 +1,201 @@ |
|||
/* fileline.c -- Get file and line number information in a backtrace.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <sys/types.h> |
|||
#include <sys/stat.h> |
|||
#include <errno.h> |
|||
#include <fcntl.h> |
|||
#include <stdlib.h> |
|||
#include <unistd.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
#ifndef HAVE_GETEXECNAME |
|||
#define getexecname() NULL |
|||
#endif |
|||
|
|||
/* Initialize the fileline information from the executable. Returns 1
|
|||
on success, 0 on failure. */ |
|||
|
|||
static int |
|||
fileline_initialize (struct backtrace_state *state, |
|||
backtrace_error_callback error_callback, void *data) |
|||
{ |
|||
int failed; |
|||
fileline fileline_fn; |
|||
int pass; |
|||
int called_error_callback; |
|||
int descriptor; |
|||
const char *filename; |
|||
char buf[64]; |
|||
|
|||
if (!state->threaded) |
|||
failed = state->fileline_initialization_failed; |
|||
else |
|||
failed = backtrace_atomic_load_int (&state->fileline_initialization_failed); |
|||
|
|||
if (failed) |
|||
{ |
|||
error_callback (data, "failed to read executable information", -1); |
|||
return 0; |
|||
} |
|||
|
|||
if (!state->threaded) |
|||
fileline_fn = state->fileline_fn; |
|||
else |
|||
fileline_fn = backtrace_atomic_load_pointer (&state->fileline_fn); |
|||
if (fileline_fn != NULL) |
|||
return 1; |
|||
|
|||
/* We have not initialized the information. Do it now. */ |
|||
|
|||
descriptor = -1; |
|||
called_error_callback = 0; |
|||
for (pass = 0; pass < 5; ++pass) |
|||
{ |
|||
int does_not_exist; |
|||
|
|||
switch (pass) |
|||
{ |
|||
case 0: |
|||
filename = state->filename; |
|||
break; |
|||
case 1: |
|||
filename = getexecname (); |
|||
break; |
|||
case 2: |
|||
filename = "/proc/self/exe"; |
|||
break; |
|||
case 3: |
|||
filename = "/proc/curproc/file"; |
|||
break; |
|||
case 4: |
|||
snprintf (buf, sizeof (buf), "/proc/%ld/object/a.out", |
|||
(long) getpid ()); |
|||
filename = buf; |
|||
break; |
|||
default: |
|||
abort (); |
|||
} |
|||
|
|||
if (filename == NULL) |
|||
continue; |
|||
|
|||
descriptor = backtrace_open (filename, error_callback, data, |
|||
&does_not_exist); |
|||
if (descriptor < 0 && !does_not_exist) |
|||
{ |
|||
called_error_callback = 1; |
|||
break; |
|||
} |
|||
if (descriptor >= 0) |
|||
break; |
|||
} |
|||
|
|||
if (descriptor < 0) |
|||
{ |
|||
if (!called_error_callback) |
|||
{ |
|||
if (state->filename != NULL) |
|||
error_callback (data, state->filename, ENOENT); |
|||
else |
|||
error_callback (data, |
|||
"libbacktrace could not find executable to open", |
|||
0); |
|||
} |
|||
failed = 1; |
|||
} |
|||
|
|||
if (!failed) |
|||
{ |
|||
if (!backtrace_initialize (state, filename, descriptor, error_callback, |
|||
data, &fileline_fn)) |
|||
failed = 1; |
|||
} |
|||
|
|||
if (failed) |
|||
{ |
|||
if (!state->threaded) |
|||
state->fileline_initialization_failed = 1; |
|||
else |
|||
backtrace_atomic_store_int (&state->fileline_initialization_failed, 1); |
|||
return 0; |
|||
} |
|||
|
|||
if (!state->threaded) |
|||
state->fileline_fn = fileline_fn; |
|||
else |
|||
{ |
|||
backtrace_atomic_store_pointer (&state->fileline_fn, fileline_fn); |
|||
|
|||
/* Note that if two threads initialize at once, one of the data
|
|||
sets may be leaked. */ |
|||
} |
|||
|
|||
return 1; |
|||
} |
|||
|
|||
/* Given a PC, find the file name, line number, and function name. */ |
|||
|
|||
int |
|||
backtrace_pcinfo (struct backtrace_state *state, uintptr_t pc, |
|||
backtrace_full_callback callback, |
|||
backtrace_error_callback error_callback, void *data) |
|||
{ |
|||
if (!fileline_initialize (state, error_callback, data)) |
|||
return 0; |
|||
|
|||
if (state->fileline_initialization_failed) |
|||
return 0; |
|||
|
|||
return state->fileline_fn (state, pc, callback, error_callback, data); |
|||
} |
|||
|
|||
/* Given a PC, find the symbol for it, and its value. */ |
|||
|
|||
int |
|||
backtrace_syminfo (struct backtrace_state *state, uintptr_t pc, |
|||
backtrace_syminfo_callback callback, |
|||
backtrace_error_callback error_callback, void *data) |
|||
{ |
|||
if (!fileline_initialize (state, error_callback, data)) |
|||
return 0; |
|||
|
|||
if (state->fileline_initialization_failed) |
|||
return 0; |
|||
|
|||
state->syminfo_fn (state, pc, callback, error_callback, data); |
|||
return 1; |
|||
} |
@ -0,0 +1,49 @@ |
|||
/* btest.c -- Filename header for libbacktrace library
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#ifndef GCC_VERSION |
|||
# define GCC_VERSION (__GNUC__ * 1000 + __GNUC_MINOR__) |
|||
#endif |
|||
|
|||
#if (GCC_VERSION < 2007) |
|||
# define __attribute__(x) |
|||
#endif |
|||
|
|||
#ifndef ATTRIBUTE_UNUSED |
|||
# define ATTRIBUTE_UNUSED __attribute__ ((__unused__)) |
|||
#endif |
|||
|
|||
#if defined(__MSDOS__) || defined(_WIN32) || defined(__OS2__) || defined (__CYGWIN__) |
|||
# define IS_DIR_SEPARATOR(c) ((c) == '/' || (c) == '\\') |
|||
#else |
|||
# define IS_DIR_SEPARATOR(c) ((c) == '/') |
|||
#endif |
@ -0,0 +1,5 @@ |
|||
# An awk script to determine the type of a file. |
|||
/\177ELF\001/ { if (NR == 1) { print "elf32"; exit } } |
|||
/\177ELF\002/ { if (NR == 1) { print "elf64"; exit } } |
|||
/\114\001/ { if (NR == 1) { print "pecoff"; exit } } |
|||
/\144\206/ { if (NR == 1) { print "pecoff"; exit } } |
@ -0,0 +1,527 @@ |
|||
#!/bin/sh |
|||
# install - install a program, script, or datafile |
|||
|
|||
scriptversion=2011-01-19.21; # UTC |
|||
|
|||
# This originates from X11R5 (mit/util/scripts/install.sh), which was |
|||
# later released in X11R6 (xc/config/util/install.sh) with the |
|||
# following copyright and license. |
|||
# |
|||
# Copyright (C) 1994 X Consortium |
|||
# |
|||
# Permission is hereby granted, free of charge, to any person obtaining a copy |
|||
# of this software and associated documentation files (the "Software"), to |
|||
# deal in the Software without restriction, including without limitation the |
|||
# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or |
|||
# sell copies of the Software, and to permit persons to whom the Software is |
|||
# furnished to do so, subject to the following conditions: |
|||
# |
|||
# The above copyright notice and this permission notice shall be included in |
|||
# all copies or substantial portions of the Software. |
|||
# |
|||
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|||
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|||
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|||
# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN |
|||
# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- |
|||
# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
|||
# |
|||
# Except as contained in this notice, the name of the X Consortium shall not |
|||
# be used in advertising or otherwise to promote the sale, use or other deal- |
|||
# ings in this Software without prior written authorization from the X Consor- |
|||
# tium. |
|||
# |
|||
# |
|||
# FSF changes to this file are in the public domain. |
|||
# |
|||
# Calling this script install-sh is preferred over install.sh, to prevent |
|||
# `make' implicit rules from creating a file called install from it |
|||
# when there is no Makefile. |
|||
# |
|||
# This script is compatible with the BSD install script, but was written |
|||
# from scratch. |
|||
|
|||
nl=' |
|||
' |
|||
IFS=" "" $nl" |
|||
|
|||
# set DOITPROG to echo to test this script |
|||
|
|||
# Don't use :- since 4.3BSD and earlier shells don't like it. |
|||
doit=${DOITPROG-} |
|||
if test -z "$doit"; then |
|||
doit_exec=exec |
|||
else |
|||
doit_exec=$doit |
|||
fi |
|||
|
|||
# Put in absolute file names if you don't have them in your path; |
|||
# or use environment vars. |
|||
|
|||
chgrpprog=${CHGRPPROG-chgrp} |
|||
chmodprog=${CHMODPROG-chmod} |
|||
chownprog=${CHOWNPROG-chown} |
|||
cmpprog=${CMPPROG-cmp} |
|||
cpprog=${CPPROG-cp} |
|||
mkdirprog=${MKDIRPROG-mkdir} |
|||
mvprog=${MVPROG-mv} |
|||
rmprog=${RMPROG-rm} |
|||
stripprog=${STRIPPROG-strip} |
|||
|
|||
posix_glob='?' |
|||
initialize_posix_glob=' |
|||
test "$posix_glob" != "?" || { |
|||
if (set -f) 2>/dev/null; then |
|||
posix_glob= |
|||
else |
|||
posix_glob=: |
|||
fi |
|||
} |
|||
' |
|||
|
|||
posix_mkdir= |
|||
|
|||
# Desired mode of installed file. |
|||
mode=0755 |
|||
|
|||
chgrpcmd= |
|||
chmodcmd=$chmodprog |
|||
chowncmd= |
|||
mvcmd=$mvprog |
|||
rmcmd="$rmprog -f" |
|||
stripcmd= |
|||
|
|||
src= |
|||
dst= |
|||
dir_arg= |
|||
dst_arg= |
|||
|
|||
copy_on_change=false |
|||
no_target_directory= |
|||
|
|||
usage="\ |
|||
Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE |
|||
or: $0 [OPTION]... SRCFILES... DIRECTORY |
|||
or: $0 [OPTION]... -t DIRECTORY SRCFILES... |
|||
or: $0 [OPTION]... -d DIRECTORIES... |
|||
|
|||
In the 1st form, copy SRCFILE to DSTFILE. |
|||
In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. |
|||
In the 4th, create DIRECTORIES. |
|||
|
|||
Options: |
|||
--help display this help and exit. |
|||
--version display version info and exit. |
|||
|
|||
-c (ignored) |
|||
-C install only if different (preserve the last data modification time) |
|||
-d create directories instead of installing files. |
|||
-g GROUP $chgrpprog installed files to GROUP. |
|||
-m MODE $chmodprog installed files to MODE. |
|||
-o USER $chownprog installed files to USER. |
|||
-s $stripprog installed files. |
|||
-t DIRECTORY install into DIRECTORY. |
|||
-T report an error if DSTFILE is a directory. |
|||
|
|||
Environment variables override the default commands: |
|||
CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG |
|||
RMPROG STRIPPROG |
|||
" |
|||
|
|||
while test $# -ne 0; do |
|||
case $1 in |
|||
-c) ;; |
|||
|
|||
-C) copy_on_change=true;; |
|||
|
|||
-d) dir_arg=true;; |
|||
|
|||
-g) chgrpcmd="$chgrpprog $2" |
|||
shift;; |
|||
|
|||
--help) echo "$usage"; exit $?;; |
|||
|
|||
-m) mode=$2 |
|||
case $mode in |
|||
*' '* | *' '* | *' |
|||
'* | *'*'* | *'?'* | *'['*) |
|||
echo "$0: invalid mode: $mode" >&2 |
|||
exit 1;; |
|||
esac |
|||
shift;; |
|||
|
|||
-o) chowncmd="$chownprog $2" |
|||
shift;; |
|||
|
|||
-s) stripcmd=$stripprog;; |
|||
|
|||
-t) dst_arg=$2 |
|||
# Protect names problematic for `test' and other utilities. |
|||
case $dst_arg in |
|||
-* | [=\(\)!]) dst_arg=./$dst_arg;; |
|||
esac |
|||
shift;; |
|||
|
|||
-T) no_target_directory=true;; |
|||
|
|||
--version) echo "$0 $scriptversion"; exit $?;; |
|||
|
|||
--) shift |
|||
break;; |
|||
|
|||
-*) echo "$0: invalid option: $1" >&2 |
|||
exit 1;; |
|||
|
|||
*) break;; |
|||
esac |
|||
shift |
|||
done |
|||
|
|||
if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then |
|||
# When -d is used, all remaining arguments are directories to create. |
|||
# When -t is used, the destination is already specified. |
|||
# Otherwise, the last argument is the destination. Remove it from $@. |
|||
for arg |
|||
do |
|||
if test -n "$dst_arg"; then |
|||
# $@ is not empty: it contains at least $arg. |
|||
set fnord "$@" "$dst_arg" |
|||
shift # fnord |
|||
fi |
|||
shift # arg |
|||
dst_arg=$arg |
|||
# Protect names problematic for `test' and other utilities. |
|||
case $dst_arg in |
|||
-* | [=\(\)!]) dst_arg=./$dst_arg;; |
|||
esac |
|||
done |
|||
fi |
|||
|
|||
if test $# -eq 0; then |
|||
if test -z "$dir_arg"; then |
|||
echo "$0: no input file specified." >&2 |
|||
exit 1 |
|||
fi |
|||
# It's OK to call `install-sh -d' without argument. |
|||
# This can happen when creating conditional directories. |
|||
exit 0 |
|||
fi |
|||
|
|||
if test -z "$dir_arg"; then |
|||
do_exit='(exit $ret); exit $ret' |
|||
trap "ret=129; $do_exit" 1 |
|||
trap "ret=130; $do_exit" 2 |
|||
trap "ret=141; $do_exit" 13 |
|||
trap "ret=143; $do_exit" 15 |
|||
|
|||
# Set umask so as not to create temps with too-generous modes. |
|||
# However, 'strip' requires both read and write access to temps. |
|||
case $mode in |
|||
# Optimize common cases. |
|||
*644) cp_umask=133;; |
|||
*755) cp_umask=22;; |
|||
|
|||
*[0-7]) |
|||
if test -z "$stripcmd"; then |
|||
u_plus_rw= |
|||
else |
|||
u_plus_rw='% 200' |
|||
fi |
|||
cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;; |
|||
*) |
|||
if test -z "$stripcmd"; then |
|||
u_plus_rw= |
|||
else |
|||
u_plus_rw=,u+rw |
|||
fi |
|||
cp_umask=$mode$u_plus_rw;; |
|||
esac |
|||
fi |
|||
|
|||
for src |
|||
do |
|||
# Protect names problematic for `test' and other utilities. |
|||
case $src in |
|||
-* | [=\(\)!]) src=./$src;; |
|||
esac |
|||
|
|||
if test -n "$dir_arg"; then |
|||
dst=$src |
|||
dstdir=$dst |
|||
test -d "$dstdir" |
|||
dstdir_status=$? |
|||
else |
|||
|
|||
# Waiting for this to be detected by the "$cpprog $src $dsttmp" command |
|||
# might cause directories to be created, which would be especially bad |
|||
# if $src (and thus $dsttmp) contains '*'. |
|||
if test ! -f "$src" && test ! -d "$src"; then |
|||
echo "$0: $src does not exist." >&2 |
|||
exit 1 |
|||
fi |
|||
|
|||
if test -z "$dst_arg"; then |
|||
echo "$0: no destination specified." >&2 |
|||
exit 1 |
|||
fi |
|||
dst=$dst_arg |
|||
|
|||
# If destination is a directory, append the input filename; won't work |
|||
# if double slashes aren't ignored. |
|||
if test -d "$dst"; then |
|||
if test -n "$no_target_directory"; then |
|||
echo "$0: $dst_arg: Is a directory" >&2 |
|||
exit 1 |
|||
fi |
|||
dstdir=$dst |
|||
dst=$dstdir/`basename "$src"` |
|||
dstdir_status=0 |
|||
else |
|||
# Prefer dirname, but fall back on a substitute if dirname fails. |
|||
dstdir=` |
|||
(dirname "$dst") 2>/dev/null || |
|||
expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ |
|||
X"$dst" : 'X\(//\)[^/]' \| \ |
|||
X"$dst" : 'X\(//\)$' \| \ |
|||
X"$dst" : 'X\(/\)' \| . 2>/dev/null || |
|||
echo X"$dst" | |
|||
sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ |
|||
s//\1/ |
|||
q |
|||
} |
|||
/^X\(\/\/\)[^/].*/{ |
|||
s//\1/ |
|||
q |
|||
} |
|||
/^X\(\/\/\)$/{ |
|||
s//\1/ |
|||
q |
|||
} |
|||
/^X\(\/\).*/{ |
|||
s//\1/ |
|||
q |
|||
} |
|||
s/.*/./; q' |
|||
` |
|||
|
|||
test -d "$dstdir" |
|||
dstdir_status=$? |
|||
fi |
|||
fi |
|||
|
|||
obsolete_mkdir_used=false |
|||
|
|||
if test $dstdir_status != 0; then |
|||
case $posix_mkdir in |
|||
'') |
|||
# Create intermediate dirs using mode 755 as modified by the umask. |
|||
# This is like FreeBSD 'install' as of 1997-10-28. |
|||
umask=`umask` |
|||
case $stripcmd.$umask in |
|||
# Optimize common cases. |
|||
*[2367][2367]) mkdir_umask=$umask;; |
|||
.*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;; |
|||
|
|||
*[0-7]) |
|||
mkdir_umask=`expr $umask + 22 \ |
|||
- $umask % 100 % 40 + $umask % 20 \ |
|||
- $umask % 10 % 4 + $umask % 2 |
|||
`;; |
|||
*) mkdir_umask=$umask,go-w;; |
|||
esac |
|||
|
|||
# With -d, create the new directory with the user-specified mode. |
|||
# Otherwise, rely on $mkdir_umask. |
|||
if test -n "$dir_arg"; then |
|||
mkdir_mode=-m$mode |
|||
else |
|||
mkdir_mode= |
|||
fi |
|||
|
|||
posix_mkdir=false |
|||
case $umask in |
|||
*[123567][0-7][0-7]) |
|||
# POSIX mkdir -p sets u+wx bits regardless of umask, which |
|||
# is incompatible with FreeBSD 'install' when (umask & 300) != 0. |
|||
;; |
|||
*) |
|||
tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$ |
|||
trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0 |
|||
|
|||
if (umask $mkdir_umask && |
|||
exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1 |
|||
then |
|||
if test -z "$dir_arg" || { |
|||
# Check for POSIX incompatibilities with -m. |
|||
# HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or |
|||
# other-writeable bit of parent directory when it shouldn't. |
|||
# FreeBSD 6.1 mkdir -m -p sets mode of existing directory. |
|||
ls_ld_tmpdir=`ls -ld "$tmpdir"` |
|||
case $ls_ld_tmpdir in |
|||
d????-?r-*) different_mode=700;; |
|||
d????-?--*) different_mode=755;; |
|||
*) false;; |
|||
esac && |
|||
$mkdirprog -m$different_mode -p -- "$tmpdir" && { |
|||
ls_ld_tmpdir_1=`ls -ld "$tmpdir"` |
|||
test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1" |
|||
} |
|||
} |
|||
then posix_mkdir=: |
|||
fi |
|||
rmdir "$tmpdir/d" "$tmpdir" |
|||
else |
|||
# Remove any dirs left behind by ancient mkdir implementations. |
|||
rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null |
|||
fi |
|||
trap '' 0;; |
|||
esac;; |
|||
esac |
|||
|
|||
if |
|||
$posix_mkdir && ( |
|||
umask $mkdir_umask && |
|||
$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir" |
|||
) |
|||
then : |
|||
else |
|||
|
|||
# The umask is ridiculous, or mkdir does not conform to POSIX, |
|||
# or it failed possibly due to a race condition. Create the |
|||
# directory the slow way, step by step, checking for races as we go. |
|||
|
|||
case $dstdir in |
|||
/*) prefix='/';; |
|||
[-=\(\)!]*) prefix='./';; |
|||
*) prefix='';; |
|||
esac |
|||
|
|||
eval "$initialize_posix_glob" |
|||
|
|||
oIFS=$IFS |
|||
IFS=/ |
|||
$posix_glob set -f |
|||
set fnord $dstdir |
|||
shift |
|||
$posix_glob set +f |
|||
IFS=$oIFS |
|||
|
|||
prefixes= |
|||
|
|||
for d |
|||
do |
|||
test X"$d" = X && continue |
|||
|
|||
prefix=$prefix$d |
|||
if test -d "$prefix"; then |
|||
prefixes= |
|||
else |
|||
if $posix_mkdir; then |
|||
(umask=$mkdir_umask && |
|||
$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break |
|||
# Don't fail if two instances are running concurrently. |
|||
test -d "$prefix" || exit 1 |
|||
else |
|||
case $prefix in |
|||
*\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;; |
|||
*) qprefix=$prefix;; |
|||
esac |
|||
prefixes="$prefixes '$qprefix'" |
|||
fi |
|||
fi |
|||
prefix=$prefix/ |
|||
done |
|||
|
|||
if test -n "$prefixes"; then |
|||
# Don't fail if two instances are running concurrently. |
|||
(umask $mkdir_umask && |
|||
eval "\$doit_exec \$mkdirprog $prefixes") || |
|||
test -d "$dstdir" || exit 1 |
|||
obsolete_mkdir_used=true |
|||
fi |
|||
fi |
|||
fi |
|||
|
|||
if test -n "$dir_arg"; then |
|||
{ test -z "$chowncmd" || $doit $chowncmd "$dst"; } && |
|||
{ test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } && |
|||
{ test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false || |
|||
test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1 |
|||
else |
|||
|
|||
# Make a couple of temp file names in the proper directory. |
|||
dsttmp=$dstdir/_inst.$$_ |
|||
rmtmp=$dstdir/_rm.$$_ |
|||
|
|||
# Trap to clean up those temp files at exit. |
|||
trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 |
|||
|
|||
# Copy the file name to the temp name. |
|||
(umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") && |
|||
|
|||
# and set any options; do chmod last to preserve setuid bits. |
|||
# |
|||
# If any of these fail, we abort the whole thing. If we want to |
|||
# ignore errors from any of these, just make sure not to ignore |
|||
# errors from the above "$doit $cpprog $src $dsttmp" command. |
|||
# |
|||
{ test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } && |
|||
{ test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } && |
|||
{ test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } && |
|||
{ test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } && |
|||
|
|||
# If -C, don't bother to copy if it wouldn't change the file. |
|||
if $copy_on_change && |
|||
old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` && |
|||
new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` && |
|||
|
|||
eval "$initialize_posix_glob" && |
|||
$posix_glob set -f && |
|||
set X $old && old=:$2:$4:$5:$6 && |
|||
set X $new && new=:$2:$4:$5:$6 && |
|||
$posix_glob set +f && |
|||
|
|||
test "$old" = "$new" && |
|||
$cmpprog "$dst" "$dsttmp" >/dev/null 2>&1 |
|||
then |
|||
rm -f "$dsttmp" |
|||
else |
|||
# Rename the file to the real destination. |
|||
$doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null || |
|||
|
|||
# The rename failed, perhaps because mv can't rename something else |
|||
# to itself, or perhaps because mv is so ancient that it does not |
|||
# support -f. |
|||
{ |
|||
# Now remove or move aside any old file at destination location. |
|||
# We try this two ways since rm can't unlink itself on some |
|||
# systems and the destination file might be busy for other |
|||
# reasons. In this case, the final cleanup might fail but the new |
|||
# file should still install successfully. |
|||
{ |
|||
test ! -f "$dst" || |
|||
$doit $rmcmd -f "$dst" 2>/dev/null || |
|||
{ $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null && |
|||
{ $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; } |
|||
} || |
|||
{ echo "$0: cannot unlink or rename $dst" >&2 |
|||
(exit 1); exit 1 |
|||
} |
|||
} && |
|||
|
|||
# Now rename the file to the real destination. |
|||
$doit $mvcmd "$dsttmp" "$dst" |
|||
} |
|||
fi || exit 1 |
|||
|
|||
trap '' 0 |
|||
fi |
|||
done |
|||
|
|||
# Local variables: |
|||
# eval: (add-hook 'write-file-hooks 'time-stamp) |
|||
# time-stamp-start: "scriptversion=" |
|||
# time-stamp-format: "%:y-%02m-%02d.%02H" |
|||
# time-stamp-time-zone: "UTC" |
|||
# time-stamp-end: "; # UTC" |
|||
# End: |
@ -0,0 +1,304 @@ |
|||
/* internal.h -- Internal header file for stack backtrace library.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#ifndef BACKTRACE_INTERNAL_H |
|||
#define BACKTRACE_INTERNAL_H |
|||
|
|||
/* We assume that <sys/types.h> and "backtrace.h" have already been
|
|||
included. */ |
|||
|
|||
#ifndef GCC_VERSION |
|||
# define GCC_VERSION (__GNUC__ * 1000 + __GNUC_MINOR__) |
|||
#endif |
|||
|
|||
#if (GCC_VERSION < 2007) |
|||
# define __attribute__(x) |
|||
#endif |
|||
|
|||
#ifndef ATTRIBUTE_UNUSED |
|||
# define ATTRIBUTE_UNUSED __attribute__ ((__unused__)) |
|||
#endif |
|||
|
|||
#ifndef ATTRIBUTE_MALLOC |
|||
# if (GCC_VERSION >= 2096) |
|||
# define ATTRIBUTE_MALLOC __attribute__ ((__malloc__)) |
|||
# else |
|||
# define ATTRIBUTE_MALLOC |
|||
# endif |
|||
#endif |
|||
|
|||
#ifndef HAVE_SYNC_FUNCTIONS |
|||
|
|||
/* Define out the sync functions. These should never be called if
|
|||
they are not available. */ |
|||
|
|||
#define __sync_bool_compare_and_swap(A, B, C) (abort(), 1) |
|||
#define __sync_lock_test_and_set(A, B) (abort(), 0) |
|||
#define __sync_lock_release(A) abort() |
|||
|
|||
#endif /* !defined (HAVE_SYNC_FUNCTIONS) */ |
|||
|
|||
#ifdef HAVE_ATOMIC_FUNCTIONS |
|||
|
|||
/* We have the atomic builtin functions. */ |
|||
|
|||
#define backtrace_atomic_load_pointer(p) \ |
|||
__atomic_load_n ((p), __ATOMIC_ACQUIRE) |
|||
#define backtrace_atomic_load_int(p) \ |
|||
__atomic_load_n ((p), __ATOMIC_ACQUIRE) |
|||
#define backtrace_atomic_store_pointer(p, v) \ |
|||
__atomic_store_n ((p), (v), __ATOMIC_RELEASE) |
|||
#define backtrace_atomic_store_size_t(p, v) \ |
|||
__atomic_store_n ((p), (v), __ATOMIC_RELEASE) |
|||
#define backtrace_atomic_store_int(p, v) \ |
|||
__atomic_store_n ((p), (v), __ATOMIC_RELEASE) |
|||
|
|||
#else /* !defined (HAVE_ATOMIC_FUNCTIONS) */ |
|||
#ifdef HAVE_SYNC_FUNCTIONS |
|||
|
|||
/* We have the sync functions but not the atomic functions. Define
|
|||
the atomic ones in terms of the sync ones. */ |
|||
|
|||
extern void *backtrace_atomic_load_pointer (void *); |
|||
extern int backtrace_atomic_load_int (int *); |
|||
extern void backtrace_atomic_store_pointer (void *, void *); |
|||
extern void backtrace_atomic_store_size_t (size_t *, size_t); |
|||
extern void backtrace_atomic_store_int (int *, int); |
|||
|
|||
#else /* !defined (HAVE_SYNC_FUNCTIONS) */ |
|||
|
|||
/* We have neither the sync nor the atomic functions. These will
|
|||
never be called. */ |
|||
|
|||
#define backtrace_atomic_load_pointer(p) (abort(), (void *) NULL) |
|||
#define backtrace_atomic_load_int(p) (abort(), 0) |
|||
#define backtrace_atomic_store_pointer(p, v) abort() |
|||
#define backtrace_atomic_store_size_t(p, v) abort() |
|||
#define backtrace_atomic_store_int(p, v) abort() |
|||
|
|||
#endif /* !defined (HAVE_SYNC_FUNCTIONS) */ |
|||
#endif /* !defined (HAVE_ATOMIC_FUNCTIONS) */ |
|||
|
|||
/* The type of the function that collects file/line information. This
|
|||
is like backtrace_pcinfo. */ |
|||
|
|||
typedef int (*fileline) (struct backtrace_state *state, uintptr_t pc, |
|||
backtrace_full_callback callback, |
|||
backtrace_error_callback error_callback, void *data); |
|||
|
|||
/* The type of the function that collects symbol information. This is
|
|||
like backtrace_syminfo. */ |
|||
|
|||
typedef void (*syminfo) (struct backtrace_state *state, uintptr_t pc, |
|||
backtrace_syminfo_callback callback, |
|||
backtrace_error_callback error_callback, void *data); |
|||
|
|||
/* What the backtrace state pointer points to. */ |
|||
|
|||
struct backtrace_state |
|||
{ |
|||
/* The name of the executable. */ |
|||
const char *filename; |
|||
/* Non-zero if threaded. */ |
|||
int threaded; |
|||
/* The master lock for fileline_fn, fileline_data, syminfo_fn,
|
|||
syminfo_data, fileline_initialization_failed and everything the |
|||
data pointers point to. */ |
|||
void *lock; |
|||
/* The function that returns file/line information. */ |
|||
fileline fileline_fn; |
|||
/* The data to pass to FILELINE_FN. */ |
|||
void *fileline_data; |
|||
/* The function that returns symbol information. */ |
|||
syminfo syminfo_fn; |
|||
/* The data to pass to SYMINFO_FN. */ |
|||
void *syminfo_data; |
|||
/* Whether initializing the file/line information failed. */ |
|||
int fileline_initialization_failed; |
|||
/* The lock for the freelist. */ |
|||
int lock_alloc; |
|||
/* The freelist when using mmap. */ |
|||
struct backtrace_freelist_struct *freelist; |
|||
}; |
|||
|
|||
/* Open a file for reading. Returns -1 on error. If DOES_NOT_EXIST
|
|||
is not NULL, *DOES_NOT_EXIST will be set to 0 normally and set to 1 |
|||
if the file does not exist. If the file does not exist and |
|||
DOES_NOT_EXIST is not NULL, the function will return -1 and will |
|||
not call ERROR_CALLBACK. On other errors, or if DOES_NOT_EXIST is |
|||
NULL, the function will call ERROR_CALLBACK before returning. */ |
|||
extern int backtrace_open (const char *filename, |
|||
backtrace_error_callback error_callback, |
|||
void *data, |
|||
int *does_not_exist); |
|||
|
|||
/* A view of the contents of a file. This supports mmap when
|
|||
available. A view will remain in memory even after backtrace_close |
|||
is called on the file descriptor from which the view was |
|||
obtained. */ |
|||
|
|||
struct backtrace_view |
|||
{ |
|||
/* The data that the caller requested. */ |
|||
const void *data; |
|||
/* The base of the view. */ |
|||
void *base; |
|||
/* The total length of the view. */ |
|||
size_t len; |
|||
}; |
|||
|
|||
/* Create a view of SIZE bytes from DESCRIPTOR at OFFSET. Store the
|
|||
result in *VIEW. Returns 1 on success, 0 on error. */ |
|||
extern int backtrace_get_view (struct backtrace_state *state, int descriptor, |
|||
off_t offset, size_t size, |
|||
backtrace_error_callback error_callback, |
|||
void *data, struct backtrace_view *view); |
|||
|
|||
/* Release a view created by backtrace_get_view. */ |
|||
extern void backtrace_release_view (struct backtrace_state *state, |
|||
struct backtrace_view *view, |
|||
backtrace_error_callback error_callback, |
|||
void *data); |
|||
|
|||
/* Close a file opened by backtrace_open. Returns 1 on success, 0 on
|
|||
error. */ |
|||
|
|||
extern int backtrace_close (int descriptor, |
|||
backtrace_error_callback error_callback, |
|||
void *data); |
|||
|
|||
/* Sort without using memory. */ |
|||
|
|||
extern void backtrace_qsort (void *base, size_t count, size_t size, |
|||
int (*compar) (const void *, const void *)); |
|||
|
|||
/* Allocate memory. This is like malloc. If ERROR_CALLBACK is NULL,
|
|||
this does not report an error, it just returns NULL. */ |
|||
|
|||
extern void *backtrace_alloc (struct backtrace_state *state, size_t size, |
|||
backtrace_error_callback error_callback, |
|||
void *data) ATTRIBUTE_MALLOC; |
|||
|
|||
/* Free memory allocated by backtrace_alloc. If ERROR_CALLBACK is
|
|||
NULL, this does not report an error. */ |
|||
|
|||
extern void backtrace_free (struct backtrace_state *state, void *mem, |
|||
size_t size, |
|||
backtrace_error_callback error_callback, |
|||
void *data); |
|||
|
|||
/* A growable vector of some struct. This is used for more efficient
|
|||
allocation when we don't know the final size of some group of data |
|||
that we want to represent as an array. */ |
|||
|
|||
struct backtrace_vector |
|||
{ |
|||
/* The base of the vector. */ |
|||
void *base; |
|||
/* The number of bytes in the vector. */ |
|||
size_t size; |
|||
/* The number of bytes available at the current allocation. */ |
|||
size_t alc; |
|||
}; |
|||
|
|||
/* Grow VEC by SIZE bytes. Return a pointer to the newly allocated
|
|||
bytes. Note that this may move the entire vector to a new memory |
|||
location. Returns NULL on failure. */ |
|||
|
|||
extern void *backtrace_vector_grow (struct backtrace_state *state, size_t size, |
|||
backtrace_error_callback error_callback, |
|||
void *data, |
|||
struct backtrace_vector *vec); |
|||
|
|||
/* Finish the current allocation on VEC. Prepare to start a new
|
|||
allocation. The finished allocation will never be freed. Returns |
|||
a pointer to the base of the finished entries, or NULL on |
|||
failure. */ |
|||
|
|||
extern void* backtrace_vector_finish (struct backtrace_state *state, |
|||
struct backtrace_vector *vec, |
|||
backtrace_error_callback error_callback, |
|||
void *data); |
|||
|
|||
/* Release any extra space allocated for VEC. This may change
|
|||
VEC->base. Returns 1 on success, 0 on failure. */ |
|||
|
|||
extern int backtrace_vector_release (struct backtrace_state *state, |
|||
struct backtrace_vector *vec, |
|||
backtrace_error_callback error_callback, |
|||
void *data); |
|||
|
|||
/* Read initial debug data from a descriptor, and set the
|
|||
fileline_data, syminfo_fn, and syminfo_data fields of STATE. |
|||
Return the fileln_fn field in *FILELN_FN--this is done this way so |
|||
that the synchronization code is only implemented once. This is |
|||
called after the descriptor has first been opened. It will close |
|||
the descriptor if it is no longer needed. Returns 1 on success, 0 |
|||
on error. There will be multiple implementations of this function, |
|||
for different file formats. Each system will compile the |
|||
appropriate one. */ |
|||
|
|||
extern int backtrace_initialize (struct backtrace_state *state, |
|||
const char *filename, |
|||
int descriptor, |
|||
backtrace_error_callback error_callback, |
|||
void *data, |
|||
fileline *fileline_fn); |
|||
|
|||
/* Add file/line information for a DWARF module. */ |
|||
|
|||
extern int backtrace_dwarf_add (struct backtrace_state *state, |
|||
uintptr_t base_address, |
|||
const unsigned char* dwarf_info, |
|||
size_t dwarf_info_size, |
|||
const unsigned char *dwarf_line, |
|||
size_t dwarf_line_size, |
|||
const unsigned char *dwarf_abbrev, |
|||
size_t dwarf_abbrev_size, |
|||
const unsigned char *dwarf_ranges, |
|||
size_t dwarf_range_size, |
|||
const unsigned char *dwarf_str, |
|||
size_t dwarf_str_size, |
|||
int is_bigendian, |
|||
backtrace_error_callback error_callback, |
|||
void *data, fileline *fileline_fn); |
|||
|
|||
/* A test-only hook for elf_uncompress_zdebug. */ |
|||
|
|||
extern int backtrace_uncompress_zdebug (struct backtrace_state *, |
|||
const unsigned char *compressed, |
|||
size_t compressed_size, |
|||
backtrace_error_callback, void *data, |
|||
unsigned char **uncompressed, |
|||
size_t *uncompressed_size); |
|||
|
|||
#endif |
File diff suppressed because it is too large
@ -0,0 +1,331 @@ |
|||
#! /bin/sh |
|||
# Common stub for a few missing GNU programs while installing. |
|||
|
|||
scriptversion=2012-01-06.13; # UTC |
|||
|
|||
# Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005, 2006, |
|||
# 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc. |
|||
# Originally by Fran,cois Pinard <pinard@iro.umontreal.ca>, 1996. |
|||
|
|||
# This program is free software; you can redistribute it and/or modify |
|||
# it under the terms of the GNU General Public License as published by |
|||
# the Free Software Foundation; either version 2, or (at your option) |
|||
# any later version. |
|||
|
|||
# This program 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 this program. If not, see <http://www.gnu.org/licenses/>. |
|||
|
|||
# As a special exception to the GNU General Public License, if you |
|||
# distribute this file as part of a program that contains a |
|||
# configuration script generated by Autoconf, you may include it under |
|||
# the same distribution terms that you use for the rest of that program. |
|||
|
|||
if test $# -eq 0; then |
|||
echo 1>&2 "Try \`$0 --help' for more information" |
|||
exit 1 |
|||
fi |
|||
|
|||
run=: |
|||
sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p' |
|||
sed_minuso='s/.* -o \([^ ]*\).*/\1/p' |
|||
|
|||
# In the cases where this matters, `missing' is being run in the |
|||
# srcdir already. |
|||
if test -f configure.ac; then |
|||
configure_ac=configure.ac |
|||
else |
|||
configure_ac=configure.in |
|||
fi |
|||
|
|||
msg="missing on your system" |
|||
|
|||
case $1 in |
|||
--run) |
|||
# Try to run requested program, and just exit if it succeeds. |
|||
run= |
|||
shift |
|||
"$@" && exit 0 |
|||
# Exit code 63 means version mismatch. This often happens |
|||
# when the user try to use an ancient version of a tool on |
|||
# a file that requires a minimum version. In this case we |
|||
# we should proceed has if the program had been absent, or |
|||
# if --run hadn't been passed. |
|||
if test $? = 63; then |
|||
run=: |
|||
msg="probably too old" |
|||
fi |
|||
;; |
|||
|
|||
-h|--h|--he|--hel|--help) |
|||
echo "\ |
|||
$0 [OPTION]... PROGRAM [ARGUMENT]... |
|||
|
|||
Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an |
|||
error status if there is no known handling for PROGRAM. |
|||
|
|||
Options: |
|||
-h, --help display this help and exit |
|||
-v, --version output version information and exit |
|||
--run try to run the given command, and emulate it if it fails |
|||
|
|||
Supported PROGRAM values: |
|||
aclocal touch file \`aclocal.m4' |
|||
autoconf touch file \`configure' |
|||
autoheader touch file \`config.h.in' |
|||
autom4te touch the output file, or create a stub one |
|||
automake touch all \`Makefile.in' files |
|||
bison create \`y.tab.[ch]', if possible, from existing .[ch] |
|||
flex create \`lex.yy.c', if possible, from existing .c |
|||
help2man touch the output file |
|||
lex create \`lex.yy.c', if possible, from existing .c |
|||
makeinfo touch the output file |
|||
yacc create \`y.tab.[ch]', if possible, from existing .[ch] |
|||
|
|||
Version suffixes to PROGRAM as well as the prefixes \`gnu-', \`gnu', and |
|||
\`g' are ignored when checking the name. |
|||
|
|||
Send bug reports to <bug-automake@gnu.org>." |
|||
exit $? |
|||
;; |
|||
|
|||
-v|--v|--ve|--ver|--vers|--versi|--versio|--version) |
|||
echo "missing $scriptversion (GNU Automake)" |
|||
exit $? |
|||
;; |
|||
|
|||
-*) |
|||
echo 1>&2 "$0: Unknown \`$1' option" |
|||
echo 1>&2 "Try \`$0 --help' for more information" |
|||
exit 1 |
|||
;; |
|||
|
|||
esac |
|||
|
|||
# normalize program name to check for. |
|||
program=`echo "$1" | sed ' |
|||
s/^gnu-//; t |
|||
s/^gnu//; t |
|||
s/^g//; t'` |
|||
|
|||
# Now exit if we have it, but it failed. Also exit now if we |
|||
# don't have it and --version was passed (most likely to detect |
|||
# the program). This is about non-GNU programs, so use $1 not |
|||
# $program. |
|||
case $1 in |
|||
lex*|yacc*) |
|||
# Not GNU programs, they don't have --version. |
|||
;; |
|||
|
|||
*) |
|||
if test -z "$run" && ($1 --version) > /dev/null 2>&1; then |
|||
# We have it, but it failed. |
|||
exit 1 |
|||
elif test "x$2" = "x--version" || test "x$2" = "x--help"; then |
|||
# Could not run --version or --help. This is probably someone |
|||
# running `$TOOL --version' or `$TOOL --help' to check whether |
|||
# $TOOL exists and not knowing $TOOL uses missing. |
|||
exit 1 |
|||
fi |
|||
;; |
|||
esac |
|||
|
|||
# If it does not exist, or fails to run (possibly an outdated version), |
|||
# try to emulate it. |
|||
case $program in |
|||
aclocal*) |
|||
echo 1>&2 "\ |
|||
WARNING: \`$1' is $msg. You should only need it if |
|||
you modified \`acinclude.m4' or \`${configure_ac}'. You might want |
|||
to install the \`Automake' and \`Perl' packages. Grab them from |
|||
any GNU archive site." |
|||
touch aclocal.m4 |
|||
;; |
|||
|
|||
autoconf*) |
|||
echo 1>&2 "\ |
|||
WARNING: \`$1' is $msg. You should only need it if |
|||
you modified \`${configure_ac}'. You might want to install the |
|||
\`Autoconf' and \`GNU m4' packages. Grab them from any GNU |
|||
archive site." |
|||
touch configure |
|||
;; |
|||
|
|||
autoheader*) |
|||
echo 1>&2 "\ |
|||
WARNING: \`$1' is $msg. You should only need it if |
|||
you modified \`acconfig.h' or \`${configure_ac}'. You might want |
|||
to install the \`Autoconf' and \`GNU m4' packages. Grab them |
|||
from any GNU archive site." |
|||
files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}` |
|||
test -z "$files" && files="config.h" |
|||
touch_files= |
|||
for f in $files; do |
|||
case $f in |
|||
*:*) touch_files="$touch_files "`echo "$f" | |
|||
sed -e 's/^[^:]*://' -e 's/:.*//'`;; |
|||
*) touch_files="$touch_files $f.in";; |
|||
esac |
|||
done |
|||
touch $touch_files |
|||
;; |
|||
|
|||
automake*) |
|||
echo 1>&2 "\ |
|||
WARNING: \`$1' is $msg. You should only need it if |
|||
you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'. |
|||
You might want to install the \`Automake' and \`Perl' packages. |
|||
Grab them from any GNU archive site." |
|||
find . -type f -name Makefile.am -print | |
|||
sed 's/\.am$/.in/' | |
|||
while read f; do touch "$f"; done |
|||
;; |
|||
|
|||
autom4te*) |
|||
echo 1>&2 "\ |
|||
WARNING: \`$1' is needed, but is $msg. |
|||
You might have modified some files without having the |
|||
proper tools for further handling them. |
|||
You can get \`$1' as part of \`Autoconf' from any GNU |
|||
archive site." |
|||
|
|||
file=`echo "$*" | sed -n "$sed_output"` |
|||
test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` |
|||
if test -f "$file"; then |
|||
touch $file |
|||
else |
|||
test -z "$file" || exec >$file |
|||
echo "#! /bin/sh" |
|||
echo "# Created by GNU Automake missing as a replacement of" |
|||
echo "# $ $@" |
|||
echo "exit 0" |
|||
chmod +x $file |
|||
exit 1 |
|||
fi |
|||
;; |
|||
|
|||
bison*|yacc*) |
|||
echo 1>&2 "\ |
|||
WARNING: \`$1' $msg. You should only need it if |
|||
you modified a \`.y' file. You may need the \`Bison' package |
|||
in order for those modifications to take effect. You can get |
|||
\`Bison' from any GNU archive site." |
|||
rm -f y.tab.c y.tab.h |
|||
if test $# -ne 1; then |
|||
eval LASTARG=\${$#} |
|||
case $LASTARG in |
|||
*.y) |
|||
SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'` |
|||
if test -f "$SRCFILE"; then |
|||
cp "$SRCFILE" y.tab.c |
|||
fi |
|||
SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'` |
|||
if test -f "$SRCFILE"; then |
|||
cp "$SRCFILE" y.tab.h |
|||
fi |
|||
;; |
|||
esac |
|||
fi |
|||
if test ! -f y.tab.h; then |
|||
echo >y.tab.h |
|||
fi |
|||
if test ! -f y.tab.c; then |
|||
echo 'main() { return 0; }' >y.tab.c |
|||
fi |
|||
;; |
|||
|
|||
lex*|flex*) |
|||
echo 1>&2 "\ |
|||
WARNING: \`$1' is $msg. You should only need it if |
|||
you modified a \`.l' file. You may need the \`Flex' package |
|||
in order for those modifications to take effect. You can get |
|||
\`Flex' from any GNU archive site." |
|||
rm -f lex.yy.c |
|||
if test $# -ne 1; then |
|||
eval LASTARG=\${$#} |
|||
case $LASTARG in |
|||
*.l) |
|||
SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'` |
|||
if test -f "$SRCFILE"; then |
|||
cp "$SRCFILE" lex.yy.c |
|||
fi |
|||
;; |
|||
esac |
|||
fi |
|||
if test ! -f lex.yy.c; then |
|||
echo 'main() { return 0; }' >lex.yy.c |
|||
fi |
|||
;; |
|||
|
|||
help2man*) |
|||
echo 1>&2 "\ |
|||
WARNING: \`$1' is $msg. You should only need it if |
|||
you modified a dependency of a manual page. You may need the |
|||
\`Help2man' package in order for those modifications to take |
|||
effect. You can get \`Help2man' from any GNU archive site." |
|||
|
|||
file=`echo "$*" | sed -n "$sed_output"` |
|||
test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` |
|||
if test -f "$file"; then |
|||
touch $file |
|||
else |
|||
test -z "$file" || exec >$file |
|||
echo ".ab help2man is required to generate this page" |
|||
exit $? |
|||
fi |
|||
;; |
|||
|
|||
makeinfo*) |
|||
echo 1>&2 "\ |
|||
WARNING: \`$1' is $msg. You should only need it if |
|||
you modified a \`.texi' or \`.texinfo' file, or any other file |
|||
indirectly affecting the aspect of the manual. The spurious |
|||
call might also be the consequence of using a buggy \`make' (AIX, |
|||
DU, IRIX). You might want to install the \`Texinfo' package or |
|||
the \`GNU make' package. Grab either from any GNU archive site." |
|||
# The file to touch is that specified with -o ... |
|||
file=`echo "$*" | sed -n "$sed_output"` |
|||
test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"` |
|||
if test -z "$file"; then |
|||
# ... or it is the one specified with @setfilename ... |
|||
infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'` |
|||
file=`sed -n ' |
|||
/^@setfilename/{ |
|||
s/.* \([^ ]*\) *$/\1/ |
|||
p |
|||
q |
|||
}' $infile` |
|||
# ... or it is derived from the source name (dir/f.texi becomes f.info) |
|||
test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info |
|||
fi |
|||
# If the file does not exist, the user really needs makeinfo; |
|||
# let's fail without touching anything. |
|||
test -f $file || exit 1 |
|||
touch $file |
|||
;; |
|||
|
|||
*) |
|||
echo 1>&2 "\ |
|||
WARNING: \`$1' is needed, and is $msg. |
|||
You might have modified some files without having the |
|||
proper tools for further handling them. Check the \`README' file, |
|||
it often tells you about the needed prerequisites for installing |
|||
this package. You may also peek at any GNU archive site, in case |
|||
some other package would contain this missing \`$1' program." |
|||
exit 1 |
|||
;; |
|||
esac |
|||
|
|||
exit 0 |
|||
|
|||
# Local variables: |
|||
# eval: (add-hook 'write-file-hooks 'time-stamp) |
|||
# time-stamp-start: "scriptversion=" |
|||
# time-stamp-format: "%:y-%02m-%02d.%02H" |
|||
# time-stamp-time-zone: "UTC" |
|||
# time-stamp-end: "; # UTC" |
|||
# End: |
@ -0,0 +1,325 @@ |
|||
/* mmap.c -- Memory allocation with mmap.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <errno.h> |
|||
#include <string.h> |
|||
#include <stdlib.h> |
|||
#include <unistd.h> |
|||
#include <sys/types.h> |
|||
#include <sys/mman.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
/* Memory allocation on systems that provide anonymous mmap. This
|
|||
permits the backtrace functions to be invoked from a signal |
|||
handler, assuming that mmap is async-signal safe. */ |
|||
|
|||
#ifndef MAP_ANONYMOUS |
|||
#define MAP_ANONYMOUS MAP_ANON |
|||
#endif |
|||
|
|||
#ifndef MAP_FAILED |
|||
#define MAP_FAILED ((void *)-1) |
|||
#endif |
|||
|
|||
/* A list of free memory blocks. */ |
|||
|
|||
struct backtrace_freelist_struct |
|||
{ |
|||
/* Next on list. */ |
|||
struct backtrace_freelist_struct *next; |
|||
/* Size of this block, including this structure. */ |
|||
size_t size; |
|||
}; |
|||
|
|||
/* Free memory allocated by backtrace_alloc. */ |
|||
|
|||
static void |
|||
backtrace_free_locked (struct backtrace_state *state, void *addr, size_t size) |
|||
{ |
|||
/* Just leak small blocks. We don't have to be perfect. Don't put
|
|||
more than 16 entries on the free list, to avoid wasting time |
|||
searching when allocating a block. If we have more than 16 |
|||
entries, leak the smallest entry. */ |
|||
|
|||
if (size >= sizeof (struct backtrace_freelist_struct)) |
|||
{ |
|||
size_t c; |
|||
struct backtrace_freelist_struct **ppsmall; |
|||
struct backtrace_freelist_struct **pp; |
|||
struct backtrace_freelist_struct *p; |
|||
|
|||
c = 0; |
|||
ppsmall = NULL; |
|||
for (pp = &state->freelist; *pp != NULL; pp = &(*pp)->next) |
|||
{ |
|||
if (ppsmall == NULL || (*pp)->size < (*ppsmall)->size) |
|||
ppsmall = pp; |
|||
++c; |
|||
} |
|||
if (c >= 16) |
|||
{ |
|||
if (size <= (*ppsmall)->size) |
|||
return; |
|||
*ppsmall = (*ppsmall)->next; |
|||
} |
|||
|
|||
p = (struct backtrace_freelist_struct *) addr; |
|||
p->next = state->freelist; |
|||
p->size = size; |
|||
state->freelist = p; |
|||
} |
|||
} |
|||
|
|||
/* Allocate memory like malloc. If ERROR_CALLBACK is NULL, don't
|
|||
report an error. */ |
|||
|
|||
void * |
|||
backtrace_alloc (struct backtrace_state *state, |
|||
size_t size, backtrace_error_callback error_callback, |
|||
void *data) |
|||
{ |
|||
void *ret; |
|||
int locked; |
|||
struct backtrace_freelist_struct **pp; |
|||
size_t pagesize; |
|||
size_t asksize; |
|||
void *page; |
|||
|
|||
ret = NULL; |
|||
|
|||
/* If we can acquire the lock, then see if there is space on the
|
|||
free list. If we can't acquire the lock, drop straight into |
|||
using mmap. __sync_lock_test_and_set returns the old state of |
|||
the lock, so we have acquired it if it returns 0. */ |
|||
|
|||
if (!state->threaded) |
|||
locked = 1; |
|||
else |
|||
locked = __sync_lock_test_and_set (&state->lock_alloc, 1) == 0; |
|||
|
|||
if (locked) |
|||
{ |
|||
for (pp = &state->freelist; *pp != NULL; pp = &(*pp)->next) |
|||
{ |
|||
if ((*pp)->size >= size) |
|||
{ |
|||
struct backtrace_freelist_struct *p; |
|||
|
|||
p = *pp; |
|||
*pp = p->next; |
|||
|
|||
/* Round for alignment; we assume that no type we care about
|
|||
is more than 8 bytes. */ |
|||
size = (size + 7) & ~ (size_t) 7; |
|||
if (size < p->size) |
|||
backtrace_free_locked (state, (char *) p + size, |
|||
p->size - size); |
|||
|
|||
ret = (void *) p; |
|||
|
|||
break; |
|||
} |
|||
} |
|||
|
|||
if (state->threaded) |
|||
__sync_lock_release (&state->lock_alloc); |
|||
} |
|||
|
|||
if (ret == NULL) |
|||
{ |
|||
/* Allocate a new page. */ |
|||
|
|||
pagesize = getpagesize (); |
|||
asksize = (size + pagesize - 1) & ~ (pagesize - 1); |
|||
page = mmap (NULL, asksize, PROT_READ | PROT_WRITE, |
|||
MAP_PRIVATE | MAP_ANONYMOUS, -1, 0); |
|||
if (page == MAP_FAILED) |
|||
{ |
|||
if (error_callback) |
|||
error_callback (data, "mmap", errno); |
|||
} |
|||
else |
|||
{ |
|||
size = (size + 7) & ~ (size_t) 7; |
|||
if (size < asksize) |
|||
backtrace_free (state, (char *) page + size, asksize - size, |
|||
error_callback, data); |
|||
|
|||
ret = page; |
|||
} |
|||
} |
|||
|
|||
return ret; |
|||
} |
|||
|
|||
/* Free memory allocated by backtrace_alloc. */ |
|||
|
|||
void |
|||
backtrace_free (struct backtrace_state *state, void *addr, size_t size, |
|||
backtrace_error_callback error_callback ATTRIBUTE_UNUSED, |
|||
void *data ATTRIBUTE_UNUSED) |
|||
{ |
|||
int locked; |
|||
|
|||
/* If we are freeing a large aligned block, just release it back to
|
|||
the system. This case arises when growing a vector for a large |
|||
binary with lots of debug info. Calling munmap here may cause us |
|||
to call mmap again if there is also a large shared library; we |
|||
just live with that. */ |
|||
if (size >= 16 * 4096) |
|||
{ |
|||
size_t pagesize; |
|||
|
|||
pagesize = getpagesize (); |
|||
if (((uintptr_t) addr & (pagesize - 1)) == 0 |
|||
&& (size & (pagesize - 1)) == 0) |
|||
{ |
|||
/* If munmap fails for some reason, just add the block to
|
|||
the freelist. */ |
|||
if (munmap (addr, size) == 0) |
|||
return; |
|||
} |
|||
} |
|||
|
|||
/* If we can acquire the lock, add the new space to the free list.
|
|||
If we can't acquire the lock, just leak the memory. |
|||
__sync_lock_test_and_set returns the old state of the lock, so we |
|||
have acquired it if it returns 0. */ |
|||
|
|||
if (!state->threaded) |
|||
locked = 1; |
|||
else |
|||
locked = __sync_lock_test_and_set (&state->lock_alloc, 1) == 0; |
|||
|
|||
if (locked) |
|||
{ |
|||
backtrace_free_locked (state, addr, size); |
|||
|
|||
if (state->threaded) |
|||
__sync_lock_release (&state->lock_alloc); |
|||
} |
|||
} |
|||
|
|||
/* Grow VEC by SIZE bytes. */ |
|||
|
|||
void * |
|||
backtrace_vector_grow (struct backtrace_state *state,size_t size, |
|||
backtrace_error_callback error_callback, |
|||
void *data, struct backtrace_vector *vec) |
|||
{ |
|||
void *ret; |
|||
|
|||
if (size > vec->alc) |
|||
{ |
|||
size_t pagesize; |
|||
size_t alc; |
|||
void *base; |
|||
|
|||
pagesize = getpagesize (); |
|||
alc = vec->size + size; |
|||
if (vec->size == 0) |
|||
alc = 16 * size; |
|||
else if (alc < pagesize) |
|||
{ |
|||
alc *= 2; |
|||
if (alc > pagesize) |
|||
alc = pagesize; |
|||
} |
|||
else |
|||
{ |
|||
alc *= 2; |
|||
alc = (alc + pagesize - 1) & ~ (pagesize - 1); |
|||
} |
|||
base = backtrace_alloc (state, alc, error_callback, data); |
|||
if (base == NULL) |
|||
return NULL; |
|||
if (vec->base != NULL) |
|||
{ |
|||
memcpy (base, vec->base, vec->size); |
|||
backtrace_free (state, vec->base, vec->size + vec->alc, |
|||
error_callback, data); |
|||
} |
|||
vec->base = base; |
|||
vec->alc = alc - vec->size; |
|||
} |
|||
|
|||
ret = (char *) vec->base + vec->size; |
|||
vec->size += size; |
|||
vec->alc -= size; |
|||
return ret; |
|||
} |
|||
|
|||
/* Finish the current allocation on VEC. */ |
|||
|
|||
void * |
|||
backtrace_vector_finish ( |
|||
struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
struct backtrace_vector *vec, |
|||
backtrace_error_callback error_callback ATTRIBUTE_UNUSED, |
|||
void *data ATTRIBUTE_UNUSED) |
|||
{ |
|||
void *ret; |
|||
|
|||
ret = vec->base; |
|||
vec->base = (char *) vec->base + vec->size; |
|||
vec->size = 0; |
|||
return ret; |
|||
} |
|||
|
|||
/* Release any extra space allocated for VEC. */ |
|||
|
|||
int |
|||
backtrace_vector_release (struct backtrace_state *state, |
|||
struct backtrace_vector *vec, |
|||
backtrace_error_callback error_callback, |
|||
void *data) |
|||
{ |
|||
size_t size; |
|||
size_t alc; |
|||
size_t aligned; |
|||
|
|||
/* Make sure that the block that we free is aligned on an 8-byte
|
|||
boundary. */ |
|||
size = vec->size; |
|||
alc = vec->alc; |
|||
aligned = (size + 7) & ~ (size_t) 7; |
|||
alc -= aligned - size; |
|||
|
|||
backtrace_free (state, (char *) vec->base + aligned, alc, |
|||
error_callback, data); |
|||
vec->alc = 0; |
|||
return 1; |
|||
} |
@ -0,0 +1,100 @@ |
|||
/* mmapio.c -- File views using mmap.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <errno.h> |
|||
#include <sys/types.h> |
|||
#include <sys/mman.h> |
|||
#include <unistd.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
#ifndef MAP_FAILED |
|||
#define MAP_FAILED ((void *)-1) |
|||
#endif |
|||
|
|||
/* This file implements file views and memory allocation when mmap is
|
|||
available. */ |
|||
|
|||
/* Create a view of SIZE bytes from DESCRIPTOR at OFFSET. */ |
|||
|
|||
int |
|||
backtrace_get_view (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
int descriptor, off_t offset, size_t size, |
|||
backtrace_error_callback error_callback, |
|||
void *data, struct backtrace_view *view) |
|||
{ |
|||
size_t pagesize; |
|||
unsigned int inpage; |
|||
off_t pageoff; |
|||
void *map; |
|||
|
|||
pagesize = getpagesize (); |
|||
inpage = offset % pagesize; |
|||
pageoff = offset - inpage; |
|||
|
|||
size += inpage; |
|||
size = (size + (pagesize - 1)) & ~ (pagesize - 1); |
|||
|
|||
map = mmap (NULL, size, PROT_READ, MAP_PRIVATE, descriptor, pageoff); |
|||
if (map == MAP_FAILED) |
|||
{ |
|||
error_callback (data, "mmap", errno); |
|||
return 0; |
|||
} |
|||
|
|||
view->data = (char *) map + inpage; |
|||
view->base = map; |
|||
view->len = size; |
|||
|
|||
return 1; |
|||
} |
|||
|
|||
/* Release a view read by backtrace_get_view. */ |
|||
|
|||
void |
|||
backtrace_release_view (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
struct backtrace_view *view, |
|||
backtrace_error_callback error_callback, |
|||
void *data) |
|||
{ |
|||
union { |
|||
const void *cv; |
|||
void *v; |
|||
} const_cast; |
|||
|
|||
const_cast.cv = view->base; |
|||
if (munmap (const_cast.v, view->len) < 0) |
|||
error_callback (data, "munmap", errno); |
|||
} |
@ -0,0 +1,83 @@ |
|||
#!/bin/sh |
|||
# Like mv $1 $2, but if the files are the same, just delete $1. |
|||
# Status is zero if successful, nonzero otherwise. |
|||
|
|||
VERSION='2012-01-06 07:23'; # UTC |
|||
# The definition above must lie within the first 8 lines in order |
|||
# for the Emacs time-stamp write hook (at end) to update it. |
|||
# If you change this file with Emacs, please let the write hook |
|||
# do its job. Otherwise, update this string manually. |
|||
|
|||
# Copyright (C) 2002-2014 Free Software Foundation, Inc. |
|||
|
|||
# This program is free software: you can redistribute it and/or modify |
|||
# it under the terms of the GNU General Public License as published by |
|||
# the Free Software Foundation, either version 3 of the License, or |
|||
# (at your option) any later version. |
|||
|
|||
# This program 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 this program. If not, see <http://www.gnu.org/licenses/>. |
|||
|
|||
usage="usage: $0 SOURCE DEST" |
|||
|
|||
help="$usage |
|||
or: $0 OPTION |
|||
If SOURCE is different than DEST, then move it to DEST; else remove SOURCE. |
|||
|
|||
--help display this help and exit |
|||
--version output version information and exit |
|||
|
|||
The variable CMPPROG can be used to specify an alternative to 'cmp'. |
|||
|
|||
Report bugs to <bug-gnulib@gnu.org>." |
|||
|
|||
version=`expr "$VERSION" : '\([^ ]*\)'` |
|||
version="move-if-change (gnulib) $version |
|||
Copyright (C) 2011 Free Software Foundation, Inc. |
|||
License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html> |
|||
This is free software: you are free to change and redistribute it. |
|||
There is NO WARRANTY, to the extent permitted by law." |
|||
|
|||
cmpprog=${CMPPROG-cmp} |
|||
|
|||
for arg |
|||
do |
|||
case $arg in |
|||
--help | --hel | --he | --h) |
|||
exec echo "$help" ;; |
|||
--version | --versio | --versi | --vers | --ver | --ve | --v) |
|||
exec echo "$version" ;; |
|||
--) |
|||
shift |
|||
break ;; |
|||
-*) |
|||
echo "$0: invalid option: $arg" >&2 |
|||
exit 1 ;; |
|||
*) |
|||
break ;; |
|||
esac |
|||
done |
|||
|
|||
test $# -eq 2 || { echo "$0: $usage" >&2; exit 1; } |
|||
|
|||
if test -r "$2" && $cmpprog -- "$1" "$2" >/dev/null; then |
|||
rm -f -- "$1" |
|||
else |
|||
if mv -f -- "$1" "$2"; then :; else |
|||
# Ignore failure due to a concurrent move-if-change. |
|||
test -r "$2" && $cmpprog -- "$1" "$2" >/dev/null && rm -f -- "$1" |
|||
fi |
|||
fi |
|||
|
|||
## Local Variables: |
|||
## eval: (add-hook 'write-file-hooks 'time-stamp) |
|||
## time-stamp-start: "VERSION='" |
|||
## time-stamp-format: "%:y-%02m-%02d %02H:%02M" |
|||
## time-stamp-time-zone: "UTC" |
|||
## time-stamp-end: "'; # UTC" |
|||
## End: |
@ -0,0 +1,66 @@ |
|||
/* backtrace.c -- Entry point for stack backtrace library.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <sys/types.h> |
|||
|
|||
#include "backtrace.h" |
|||
|
|||
#include "internal.h" |
|||
|
|||
/* This source file is compiled if the unwind library is not
|
|||
available. */ |
|||
|
|||
int |
|||
backtrace_full (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
int skip ATTRIBUTE_UNUSED, |
|||
backtrace_full_callback callback ATTRIBUTE_UNUSED, |
|||
backtrace_error_callback error_callback, void *data) |
|||
{ |
|||
error_callback (data, |
|||
"no stack trace because unwind library not available", |
|||
0); |
|||
return 0; |
|||
} |
|||
|
|||
int |
|||
backtrace_simple (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
int skip ATTRIBUTE_UNUSED, |
|||
backtrace_simple_callback callback ATTRIBUTE_UNUSED, |
|||
backtrace_error_callback error_callback, void *data) |
|||
{ |
|||
error_callback (data, |
|||
"no stack trace because unwind library not available", |
|||
0); |
|||
return 0; |
|||
} |
@ -0,0 +1,941 @@ |
|||
/* pecoff.c -- Get debug data from a PE/COFFF file for backtraces.
|
|||
Copyright (C) 2015-2018 Free Software Foundation, Inc. |
|||
Adapted from elf.c by Tristan Gingold, AdaCore. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
#include <sys/types.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
/* Coff file header. */ |
|||
|
|||
typedef struct { |
|||
uint16_t machine; |
|||
uint16_t number_of_sections; |
|||
uint32_t time_date_stamp; |
|||
uint32_t pointer_to_symbol_table; |
|||
uint32_t number_of_symbols; |
|||
uint16_t size_of_optional_header; |
|||
uint16_t characteristics; |
|||
} b_coff_file_header; |
|||
|
|||
/* Coff optional header. */ |
|||
|
|||
typedef struct { |
|||
uint16_t magic; |
|||
uint8_t major_linker_version; |
|||
uint8_t minor_linker_version; |
|||
uint32_t size_of_code; |
|||
uint32_t size_of_initialized_data; |
|||
uint32_t size_of_uninitialized_data; |
|||
uint32_t address_of_entry_point; |
|||
uint32_t base_of_code; |
|||
union { |
|||
struct { |
|||
uint32_t base_of_data; |
|||
uint32_t image_base; |
|||
} pe; |
|||
struct { |
|||
uint64_t image_base; |
|||
} pep; |
|||
} u; |
|||
} b_coff_optional_header; |
|||
|
|||
/* Values of magic in optional header. */ |
|||
|
|||
#define PE_MAGIC 0x10b /* PE32 executable. */ |
|||
#define PEP_MAGIC 0x20b /* PE32+ executable (for 64bit targets). */ |
|||
|
|||
/* Coff section header. */ |
|||
|
|||
typedef struct { |
|||
char name[8]; |
|||
uint32_t virtual_size; |
|||
uint32_t virtual_address; |
|||
uint32_t size_of_raw_data; |
|||
uint32_t pointer_to_raw_data; |
|||
uint32_t pointer_to_relocations; |
|||
uint32_t pointer_to_line_numbers; |
|||
uint16_t number_of_relocations; |
|||
uint16_t number_of_line_numbers; |
|||
uint32_t characteristics; |
|||
} b_coff_section_header; |
|||
|
|||
/* Coff symbol name. */ |
|||
|
|||
typedef union { |
|||
char short_name[8]; |
|||
struct { |
|||
unsigned char zeroes[4]; |
|||
unsigned char off[4]; |
|||
} long_name; |
|||
} b_coff_name; |
|||
|
|||
/* Coff symbol (external representation which is unaligned). */ |
|||
|
|||
typedef struct { |
|||
b_coff_name name; |
|||
unsigned char value[4]; |
|||
unsigned char section_number[2]; |
|||
unsigned char type[2]; |
|||
unsigned char storage_class; |
|||
unsigned char number_of_aux_symbols; |
|||
} b_coff_external_symbol; |
|||
|
|||
/* Symbol types. */ |
|||
|
|||
#define N_TBSHFT 4 /* Shift for the derived type. */ |
|||
#define IMAGE_SYM_DTYPE_FUNCTION 2 /* Function derived type. */ |
|||
|
|||
/* Size of a coff symbol. */ |
|||
|
|||
#define SYM_SZ 18 |
|||
|
|||
/* Coff symbol, internal representation (aligned). */ |
|||
|
|||
typedef struct { |
|||
const char *name; |
|||
uint32_t value; |
|||
int16_t sec; |
|||
uint16_t type; |
|||
uint16_t sc; |
|||
} b_coff_internal_symbol; |
|||
|
|||
/* An index of sections we care about. */ |
|||
|
|||
enum debug_section |
|||
{ |
|||
DEBUG_INFO, |
|||
DEBUG_LINE, |
|||
DEBUG_ABBREV, |
|||
DEBUG_RANGES, |
|||
DEBUG_STR, |
|||
DEBUG_MAX |
|||
}; |
|||
|
|||
/* Names of sections, indexed by enum debug_section. */ |
|||
|
|||
static const char * const debug_section_names[DEBUG_MAX] = |
|||
{ |
|||
".debug_info", |
|||
".debug_line", |
|||
".debug_abbrev", |
|||
".debug_ranges", |
|||
".debug_str" |
|||
}; |
|||
|
|||
/* Information we gather for the sections we care about. */ |
|||
|
|||
struct debug_section_info |
|||
{ |
|||
/* Section file offset. */ |
|||
off_t offset; |
|||
/* Section size. */ |
|||
size_t size; |
|||
/* Section contents, after read from file. */ |
|||
const unsigned char *data; |
|||
}; |
|||
|
|||
/* Information we keep for an coff symbol. */ |
|||
|
|||
struct coff_symbol |
|||
{ |
|||
/* The name of the symbol. */ |
|||
const char *name; |
|||
/* The address of the symbol. */ |
|||
uintptr_t address; |
|||
}; |
|||
|
|||
/* Information to pass to coff_syminfo. */ |
|||
|
|||
struct coff_syminfo_data |
|||
{ |
|||
/* Symbols for the next module. */ |
|||
struct coff_syminfo_data *next; |
|||
/* The COFF symbols, sorted by address. */ |
|||
struct coff_symbol *symbols; |
|||
/* The number of symbols. */ |
|||
size_t count; |
|||
}; |
|||
|
|||
/* A dummy callback function used when we can't find any debug info. */ |
|||
|
|||
static int |
|||
coff_nodebug (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
uintptr_t pc ATTRIBUTE_UNUSED, |
|||
backtrace_full_callback callback ATTRIBUTE_UNUSED, |
|||
backtrace_error_callback error_callback, void *data) |
|||
{ |
|||
error_callback (data, "no debug info in PE/COFF executable", -1); |
|||
return 0; |
|||
} |
|||
|
|||
/* A dummy callback function used when we can't find a symbol
|
|||
table. */ |
|||
|
|||
static void |
|||
coff_nosyms (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
uintptr_t addr ATTRIBUTE_UNUSED, |
|||
backtrace_syminfo_callback callback ATTRIBUTE_UNUSED, |
|||
backtrace_error_callback error_callback, void *data) |
|||
{ |
|||
error_callback (data, "no symbol table in PE/COFF executable", -1); |
|||
} |
|||
|
|||
/* Read a potentially unaligned 4 byte word at P, using native endianness. */ |
|||
|
|||
static uint32_t |
|||
coff_read4 (const unsigned char *p) |
|||
{ |
|||
uint32_t res; |
|||
|
|||
memcpy (&res, p, 4); |
|||
return res; |
|||
} |
|||
|
|||
/* Read a potentially unaligned 2 byte word at P, using native endianness.
|
|||
All 2 byte word in symbols are always aligned, but for coherency all |
|||
fields are declared as char arrays. */ |
|||
|
|||
static uint16_t |
|||
coff_read2 (const unsigned char *p) |
|||
{ |
|||
uint16_t res; |
|||
|
|||
memcpy (&res, p, sizeof (res)); |
|||
return res; |
|||
} |
|||
|
|||
/* Return the length (without the trailing 0) of a COFF short name. */ |
|||
|
|||
static size_t |
|||
coff_short_name_len (const char *name) |
|||
{ |
|||
int i; |
|||
|
|||
for (i = 0; i < 8; i++) |
|||
if (name[i] == 0) |
|||
return i; |
|||
return 8; |
|||
} |
|||
|
|||
/* Return true iff COFF short name CNAME is the same as NAME (a NUL-terminated
|
|||
string). */ |
|||
|
|||
static int |
|||
coff_short_name_eq (const char *name, const char *cname) |
|||
{ |
|||
int i; |
|||
|
|||
for (i = 0; i < 8; i++) |
|||
{ |
|||
if (name[i] != cname[i]) |
|||
return 0; |
|||
if (name[i] == 0) |
|||
return 1; |
|||
} |
|||
return name[8] == 0; |
|||
} |
|||
|
|||
/* Return true iff NAME is the same as string at offset OFF. */ |
|||
|
|||
static int |
|||
coff_long_name_eq (const char *name, unsigned int off, |
|||
struct backtrace_view *str_view) |
|||
{ |
|||
if (off >= str_view->len) |
|||
return 0; |
|||
return strcmp (name, (const char *)str_view->data + off) == 0; |
|||
} |
|||
|
|||
/* Compare struct coff_symbol for qsort. */ |
|||
|
|||
static int |
|||
coff_symbol_compare (const void *v1, const void *v2) |
|||
{ |
|||
const struct coff_symbol *e1 = (const struct coff_symbol *) v1; |
|||
const struct coff_symbol *e2 = (const struct coff_symbol *) v2; |
|||
|
|||
if (e1->address < e2->address) |
|||
return -1; |
|||
else if (e1->address > e2->address) |
|||
return 1; |
|||
else |
|||
return 0; |
|||
} |
|||
|
|||
/* Convert SYM to internal (and aligned) format ISYM, using string table
|
|||
from STRTAB and STRTAB_SIZE, and number of sections SECTS_NUM. |
|||
Return -1 in case of error (invalid section number or string index). */ |
|||
|
|||
static int |
|||
coff_expand_symbol (b_coff_internal_symbol *isym, |
|||
const b_coff_external_symbol *sym, |
|||
uint16_t sects_num, |
|||
const unsigned char *strtab, size_t strtab_size) |
|||
{ |
|||
isym->type = coff_read2 (sym->type); |
|||
isym->sec = coff_read2 (sym->section_number); |
|||
isym->sc = sym->storage_class; |
|||
|
|||
if (isym->sec > 0 && (uint16_t) isym->sec > sects_num) |
|||
return -1; |
|||
if (sym->name.short_name[0] != 0) |
|||
isym->name = sym->name.short_name; |
|||
else |
|||
{ |
|||
uint32_t off = coff_read4 (sym->name.long_name.off); |
|||
|
|||
if (off >= strtab_size) |
|||
return -1; |
|||
isym->name = (const char *) strtab + off; |
|||
} |
|||
return 0; |
|||
} |
|||
|
|||
/* Return true iff SYM is a defined symbol for a function. Data symbols
|
|||
aren't considered because they aren't easily identified (same type as |
|||
section names, presence of symbols defined by the linker script). */ |
|||
|
|||
static int |
|||
coff_is_function_symbol (const b_coff_internal_symbol *isym) |
|||
{ |
|||
return (isym->type >> N_TBSHFT) == IMAGE_SYM_DTYPE_FUNCTION |
|||
&& isym->sec > 0; |
|||
} |
|||
|
|||
/* Initialize the symbol table info for coff_syminfo. */ |
|||
|
|||
static int |
|||
coff_initialize_syminfo (struct backtrace_state *state, |
|||
uintptr_t base_address, |
|||
const b_coff_section_header *sects, size_t sects_num, |
|||
const b_coff_external_symbol *syms, size_t syms_size, |
|||
const unsigned char *strtab, size_t strtab_size, |
|||
backtrace_error_callback error_callback, |
|||
void *data, struct coff_syminfo_data *sdata) |
|||
{ |
|||
size_t syms_count; |
|||
char *coff_symstr; |
|||
size_t coff_symstr_len; |
|||
size_t coff_symbol_count; |
|||
size_t coff_symbol_size; |
|||
struct coff_symbol *coff_symbols; |
|||
struct coff_symbol *coff_sym; |
|||
char *coff_str; |
|||
size_t i; |
|||
|
|||
syms_count = syms_size / SYM_SZ; |
|||
|
|||
/* We only care about function symbols. Count them. Also count size of
|
|||
strings for in-symbol names. */ |
|||
coff_symbol_count = 0; |
|||
coff_symstr_len = 0; |
|||
for (i = 0; i < syms_count; ++i) |
|||
{ |
|||
const b_coff_external_symbol *asym = &syms[i]; |
|||
b_coff_internal_symbol isym; |
|||
|
|||
if (coff_expand_symbol (&isym, asym, sects_num, strtab, strtab_size) < 0) |
|||
{ |
|||
error_callback (data, "invalid section or offset in coff symbol", 0); |
|||
return 0; |
|||
} |
|||
if (coff_is_function_symbol (&isym)) |
|||
{ |
|||
++coff_symbol_count; |
|||
if (asym->name.short_name[0] != 0) |
|||
coff_symstr_len += coff_short_name_len (asym->name.short_name) + 1; |
|||
} |
|||
|
|||
i += asym->number_of_aux_symbols; |
|||
} |
|||
|
|||
coff_symbol_size = (coff_symbol_count + 1) * sizeof (struct coff_symbol); |
|||
coff_symbols = ((struct coff_symbol *) |
|||
backtrace_alloc (state, coff_symbol_size, error_callback, |
|||
data)); |
|||
if (coff_symbols == NULL) |
|||
return 0; |
|||
|
|||
/* Allocate memory for symbols strings. */ |
|||
if (coff_symstr_len > 0) |
|||
{ |
|||
coff_symstr = ((char *) |
|||
backtrace_alloc (state, coff_symstr_len, error_callback, |
|||
data)); |
|||
if (coff_symstr == NULL) |
|||
{ |
|||
backtrace_free (state, coff_symbols, coff_symbol_size, |
|||
error_callback, data); |
|||
return 0; |
|||
} |
|||
} |
|||
else |
|||
coff_symstr = NULL; |
|||
|
|||
/* Copy symbols. */ |
|||
coff_sym = coff_symbols; |
|||
coff_str = coff_symstr; |
|||
for (i = 0; i < syms_count; ++i) |
|||
{ |
|||
const b_coff_external_symbol *asym = &syms[i]; |
|||
b_coff_internal_symbol isym; |
|||
|
|||
if (coff_expand_symbol (&isym, asym, sects_num, strtab, strtab_size)) |
|||
{ |
|||
/* Should not fail, as it was already tested in the previous
|
|||
loop. */ |
|||
abort (); |
|||
} |
|||
if (coff_is_function_symbol (&isym)) |
|||
{ |
|||
const char *name; |
|||
int16_t secnum; |
|||
|
|||
if (asym->name.short_name[0] != 0) |
|||
{ |
|||
size_t len = coff_short_name_len (isym.name); |
|||
name = coff_str; |
|||
memcpy (coff_str, isym.name, len); |
|||
coff_str[len] = 0; |
|||
coff_str += len + 1; |
|||
} |
|||
else |
|||
name = isym.name; |
|||
|
|||
/* Strip leading '_'. */ |
|||
if (name[0] == '_') |
|||
name++; |
|||
|
|||
/* Symbol value is section relative, so we need to read the address
|
|||
of its section. */ |
|||
secnum = coff_read2 (asym->section_number); |
|||
|
|||
coff_sym->name = name; |
|||
coff_sym->address = (coff_read4 (asym->value) |
|||
+ sects[secnum - 1].virtual_address |
|||
+ base_address); |
|||
coff_sym++; |
|||
} |
|||
|
|||
i += asym->number_of_aux_symbols; |
|||
} |
|||
|
|||
/* End of symbols marker. */ |
|||
coff_sym->name = NULL; |
|||
coff_sym->address = -1; |
|||
|
|||
backtrace_qsort (coff_symbols, coff_symbol_count, |
|||
sizeof (struct coff_symbol), coff_symbol_compare); |
|||
|
|||
sdata->next = NULL; |
|||
sdata->symbols = coff_symbols; |
|||
sdata->count = coff_symbol_count; |
|||
|
|||
return 1; |
|||
} |
|||
|
|||
/* Add EDATA to the list in STATE. */ |
|||
|
|||
static void |
|||
coff_add_syminfo_data (struct backtrace_state *state, |
|||
struct coff_syminfo_data *sdata) |
|||
{ |
|||
if (!state->threaded) |
|||
{ |
|||
struct coff_syminfo_data **pp; |
|||
|
|||
for (pp = (struct coff_syminfo_data **) (void *) &state->syminfo_data; |
|||
*pp != NULL; |
|||
pp = &(*pp)->next) |
|||
; |
|||
*pp = sdata; |
|||
} |
|||
else |
|||
{ |
|||
while (1) |
|||
{ |
|||
struct coff_syminfo_data **pp; |
|||
|
|||
pp = (struct coff_syminfo_data **) (void *) &state->syminfo_data; |
|||
|
|||
while (1) |
|||
{ |
|||
struct coff_syminfo_data *p; |
|||
|
|||
p = backtrace_atomic_load_pointer (pp); |
|||
|
|||
if (p == NULL) |
|||
break; |
|||
|
|||
pp = &p->next; |
|||
} |
|||
|
|||
if (__sync_bool_compare_and_swap (pp, NULL, sdata)) |
|||
break; |
|||
} |
|||
} |
|||
} |
|||
|
|||
/* Compare an ADDR against an elf_symbol for bsearch. We allocate one
|
|||
extra entry in the array so that this can look safely at the next |
|||
entry. */ |
|||
|
|||
static int |
|||
coff_symbol_search (const void *vkey, const void *ventry) |
|||
{ |
|||
const uintptr_t *key = (const uintptr_t *) vkey; |
|||
const struct coff_symbol *entry = (const struct coff_symbol *) ventry; |
|||
uintptr_t addr; |
|||
|
|||
addr = *key; |
|||
if (addr < entry->address) |
|||
return -1; |
|||
else if (addr >= entry[1].address) |
|||
return 1; |
|||
else |
|||
return 0; |
|||
} |
|||
|
|||
/* Return the symbol name and value for an ADDR. */ |
|||
|
|||
static void |
|||
coff_syminfo (struct backtrace_state *state, uintptr_t addr, |
|||
backtrace_syminfo_callback callback, |
|||
backtrace_error_callback error_callback ATTRIBUTE_UNUSED, |
|||
void *data) |
|||
{ |
|||
struct coff_syminfo_data *sdata; |
|||
struct coff_symbol *sym = NULL; |
|||
|
|||
if (!state->threaded) |
|||
{ |
|||
for (sdata = (struct coff_syminfo_data *) state->syminfo_data; |
|||
sdata != NULL; |
|||
sdata = sdata->next) |
|||
{ |
|||
sym = ((struct coff_symbol *) |
|||
bsearch (&addr, sdata->symbols, sdata->count, |
|||
sizeof (struct coff_symbol), coff_symbol_search)); |
|||
if (sym != NULL) |
|||
break; |
|||
} |
|||
} |
|||
else |
|||
{ |
|||
struct coff_syminfo_data **pp; |
|||
|
|||
pp = (struct coff_syminfo_data **) (void *) &state->syminfo_data; |
|||
while (1) |
|||
{ |
|||
sdata = backtrace_atomic_load_pointer (pp); |
|||
if (sdata == NULL) |
|||
break; |
|||
|
|||
sym = ((struct coff_symbol *) |
|||
bsearch (&addr, sdata->symbols, sdata->count, |
|||
sizeof (struct coff_symbol), coff_symbol_search)); |
|||
if (sym != NULL) |
|||
break; |
|||
|
|||
pp = &sdata->next; |
|||
} |
|||
} |
|||
|
|||
if (sym == NULL) |
|||
callback (data, addr, NULL, 0, 0); |
|||
else |
|||
callback (data, addr, sym->name, sym->address, 0); |
|||
} |
|||
|
|||
/* Add the backtrace data for one PE/COFF file. Returns 1 on success,
|
|||
0 on failure (in both cases descriptor is closed). */ |
|||
|
|||
static int |
|||
coff_add (struct backtrace_state *state, int descriptor, |
|||
backtrace_error_callback error_callback, void *data, |
|||
fileline *fileline_fn, int *found_sym, int *found_dwarf) |
|||
{ |
|||
struct backtrace_view fhdr_view; |
|||
off_t fhdr_off; |
|||
int magic_ok; |
|||
b_coff_file_header fhdr; |
|||
off_t opt_sects_off; |
|||
size_t opt_sects_size; |
|||
unsigned int sects_num; |
|||
struct backtrace_view sects_view; |
|||
int sects_view_valid; |
|||
const b_coff_optional_header *opt_hdr; |
|||
const b_coff_section_header *sects; |
|||
struct backtrace_view str_view; |
|||
int str_view_valid; |
|||
size_t str_size; |
|||
off_t str_off; |
|||
struct backtrace_view syms_view; |
|||
off_t syms_off; |
|||
size_t syms_size; |
|||
int syms_view_valid; |
|||
unsigned int syms_num; |
|||
unsigned int i; |
|||
struct debug_section_info sections[DEBUG_MAX]; |
|||
off_t min_offset; |
|||
off_t max_offset; |
|||
struct backtrace_view debug_view; |
|||
int debug_view_valid; |
|||
uintptr_t image_base; |
|||
|
|||
*found_sym = 0; |
|||
*found_dwarf = 0; |
|||
|
|||
sects_view_valid = 0; |
|||
syms_view_valid = 0; |
|||
str_view_valid = 0; |
|||
debug_view_valid = 0; |
|||
|
|||
/* Map the MS-DOS stub (if any) and extract file header offset. */ |
|||
if (!backtrace_get_view (state, descriptor, 0, 0x40, error_callback, |
|||
data, &fhdr_view)) |
|||
goto fail; |
|||
|
|||
{ |
|||
const unsigned char *vptr = fhdr_view.data; |
|||
|
|||
if (vptr[0] == 'M' && vptr[1] == 'Z') |
|||
fhdr_off = coff_read4 (vptr + 0x3c); |
|||
else |
|||
fhdr_off = 0; |
|||
} |
|||
|
|||
backtrace_release_view (state, &fhdr_view, error_callback, data); |
|||
|
|||
/* Map the coff file header. */ |
|||
if (!backtrace_get_view (state, descriptor, fhdr_off, |
|||
sizeof (b_coff_file_header) + 4, |
|||
error_callback, data, &fhdr_view)) |
|||
goto fail; |
|||
|
|||
if (fhdr_off != 0) |
|||
{ |
|||
const char *magic = (const char *) fhdr_view.data; |
|||
magic_ok = memcmp (magic, "PE\0", 4) == 0; |
|||
fhdr_off += 4; |
|||
|
|||
memcpy (&fhdr, fhdr_view.data + 4, sizeof fhdr); |
|||
} |
|||
else |
|||
{ |
|||
memcpy (&fhdr, fhdr_view.data, sizeof fhdr); |
|||
/* TODO: test fhdr.machine for coff but non-PE platforms. */ |
|||
magic_ok = 0; |
|||
} |
|||
backtrace_release_view (state, &fhdr_view, error_callback, data); |
|||
|
|||
if (!magic_ok) |
|||
{ |
|||
error_callback (data, "executable file is not COFF", 0); |
|||
goto fail; |
|||
} |
|||
|
|||
sects_num = fhdr.number_of_sections; |
|||
syms_num = fhdr.number_of_symbols; |
|||
|
|||
opt_sects_off = fhdr_off + sizeof (fhdr); |
|||
opt_sects_size = (fhdr.size_of_optional_header |
|||
+ sects_num * sizeof (b_coff_section_header)); |
|||
|
|||
/* To translate PC to file/line when using DWARF, we need to find
|
|||
the .debug_info and .debug_line sections. */ |
|||
|
|||
/* Read the optional header and the section headers. */ |
|||
|
|||
if (!backtrace_get_view (state, descriptor, opt_sects_off, opt_sects_size, |
|||
error_callback, data, §s_view)) |
|||
goto fail; |
|||
sects_view_valid = 1; |
|||
opt_hdr = (const b_coff_optional_header *) sects_view.data; |
|||
sects = (const b_coff_section_header *) |
|||
(sects_view.data + fhdr.size_of_optional_header); |
|||
|
|||
if (fhdr.size_of_optional_header > sizeof (*opt_hdr)) |
|||
{ |
|||
if (opt_hdr->magic == PE_MAGIC) |
|||
image_base = opt_hdr->u.pe.image_base; |
|||
else if (opt_hdr->magic == PEP_MAGIC) |
|||
image_base = opt_hdr->u.pep.image_base; |
|||
else |
|||
{ |
|||
error_callback (data, "bad magic in PE optional header", 0); |
|||
goto fail; |
|||
} |
|||
} |
|||
else |
|||
image_base = 0; |
|||
|
|||
/* Read the symbol table and the string table. */ |
|||
|
|||
if (fhdr.pointer_to_symbol_table == 0) |
|||
{ |
|||
/* No symbol table, no string table. */ |
|||
str_off = 0; |
|||
str_size = 0; |
|||
syms_num = 0; |
|||
syms_size = 0; |
|||
} |
|||
else |
|||
{ |
|||
/* Symbol table is followed by the string table. The string table
|
|||
starts with its length (on 4 bytes). |
|||
Map the symbol table and the length of the string table. */ |
|||
syms_off = fhdr.pointer_to_symbol_table; |
|||
syms_size = syms_num * SYM_SZ; |
|||
|
|||
if (!backtrace_get_view (state, descriptor, syms_off, syms_size + 4, |
|||
error_callback, data, &syms_view)) |
|||
goto fail; |
|||
syms_view_valid = 1; |
|||
|
|||
str_size = coff_read4 (syms_view.data + syms_size); |
|||
|
|||
str_off = syms_off + syms_size; |
|||
|
|||
if (str_size > 4) |
|||
{ |
|||
/* Map string table (including the length word). */ |
|||
|
|||
if (!backtrace_get_view (state, descriptor, str_off, str_size, |
|||
error_callback, data, &str_view)) |
|||
goto fail; |
|||
str_view_valid = 1; |
|||
} |
|||
} |
|||
|
|||
memset (sections, 0, sizeof sections); |
|||
|
|||
/* Look for the symbol table. */ |
|||
for (i = 0; i < sects_num; ++i) |
|||
{ |
|||
const b_coff_section_header *s = sects + i; |
|||
unsigned int str_off; |
|||
int j; |
|||
|
|||
if (s->name[0] == '/') |
|||
{ |
|||
/* Extended section name. */ |
|||
str_off = atoi (s->name + 1); |
|||
} |
|||
else |
|||
str_off = 0; |
|||
|
|||
for (j = 0; j < (int) DEBUG_MAX; ++j) |
|||
{ |
|||
const char *dbg_name = debug_section_names[j]; |
|||
int match; |
|||
|
|||
if (str_off != 0) |
|||
match = coff_long_name_eq (dbg_name, str_off, &str_view); |
|||
else |
|||
match = coff_short_name_eq (dbg_name, s->name); |
|||
if (match) |
|||
{ |
|||
sections[j].offset = s->pointer_to_raw_data; |
|||
sections[j].size = s->virtual_size <= s->size_of_raw_data ? |
|||
s->virtual_size : s->size_of_raw_data; |
|||
break; |
|||
} |
|||
} |
|||
} |
|||
|
|||
if (syms_num != 0) |
|||
{ |
|||
struct coff_syminfo_data *sdata; |
|||
|
|||
sdata = ((struct coff_syminfo_data *) |
|||
backtrace_alloc (state, sizeof *sdata, error_callback, data)); |
|||
if (sdata == NULL) |
|||
goto fail; |
|||
|
|||
if (!coff_initialize_syminfo (state, image_base, |
|||
sects, sects_num, |
|||
syms_view.data, syms_size, |
|||
str_view.data, str_size, |
|||
error_callback, data, sdata)) |
|||
{ |
|||
backtrace_free (state, sdata, sizeof *sdata, error_callback, data); |
|||
goto fail; |
|||
} |
|||
|
|||
*found_sym = 1; |
|||
|
|||
coff_add_syminfo_data (state, sdata); |
|||
} |
|||
|
|||
backtrace_release_view (state, §s_view, error_callback, data); |
|||
sects_view_valid = 0; |
|||
if (syms_view_valid) |
|||
{ |
|||
backtrace_release_view (state, &syms_view, error_callback, data); |
|||
syms_view_valid = 0; |
|||
} |
|||
|
|||
/* Read all the debug sections in a single view, since they are
|
|||
probably adjacent in the file. We never release this view. */ |
|||
|
|||
min_offset = 0; |
|||
max_offset = 0; |
|||
for (i = 0; i < (int) DEBUG_MAX; ++i) |
|||
{ |
|||
off_t end; |
|||
|
|||
if (sections[i].size == 0) |
|||
continue; |
|||
if (min_offset == 0 || sections[i].offset < min_offset) |
|||
min_offset = sections[i].offset; |
|||
end = sections[i].offset + sections[i].size; |
|||
if (end > max_offset) |
|||
max_offset = end; |
|||
} |
|||
if (min_offset == 0 || max_offset == 0) |
|||
{ |
|||
if (!backtrace_close (descriptor, error_callback, data)) |
|||
goto fail; |
|||
*fileline_fn = coff_nodebug; |
|||
return 1; |
|||
} |
|||
|
|||
if (!backtrace_get_view (state, descriptor, min_offset, |
|||
max_offset - min_offset, |
|||
error_callback, data, &debug_view)) |
|||
goto fail; |
|||
debug_view_valid = 1; |
|||
|
|||
/* We've read all we need from the executable. */ |
|||
if (!backtrace_close (descriptor, error_callback, data)) |
|||
goto fail; |
|||
descriptor = -1; |
|||
|
|||
for (i = 0; i < (int) DEBUG_MAX; ++i) |
|||
{ |
|||
if (sections[i].size == 0) |
|||
sections[i].data = NULL; |
|||
else |
|||
sections[i].data = ((const unsigned char *) debug_view.data |
|||
+ (sections[i].offset - min_offset)); |
|||
} |
|||
|
|||
if (!backtrace_dwarf_add (state, /* base_address */ 0, |
|||
sections[DEBUG_INFO].data, |
|||
sections[DEBUG_INFO].size, |
|||
sections[DEBUG_LINE].data, |
|||
sections[DEBUG_LINE].size, |
|||
sections[DEBUG_ABBREV].data, |
|||
sections[DEBUG_ABBREV].size, |
|||
sections[DEBUG_RANGES].data, |
|||
sections[DEBUG_RANGES].size, |
|||
sections[DEBUG_STR].data, |
|||
sections[DEBUG_STR].size, |
|||
0, /* FIXME */ |
|||
error_callback, data, fileline_fn)) |
|||
goto fail; |
|||
|
|||
*found_dwarf = 1; |
|||
|
|||
return 1; |
|||
|
|||
fail: |
|||
if (sects_view_valid) |
|||
backtrace_release_view (state, §s_view, error_callback, data); |
|||
if (str_view_valid) |
|||
backtrace_release_view (state, &str_view, error_callback, data); |
|||
if (syms_view_valid) |
|||
backtrace_release_view (state, &syms_view, error_callback, data); |
|||
if (debug_view_valid) |
|||
backtrace_release_view (state, &debug_view, error_callback, data); |
|||
if (descriptor != -1) |
|||
backtrace_close (descriptor, error_callback, data); |
|||
return 0; |
|||
} |
|||
|
|||
/* Initialize the backtrace data we need from an ELF executable. At
|
|||
the ELF level, all we need to do is find the debug info |
|||
sections. */ |
|||
|
|||
int |
|||
backtrace_initialize (struct backtrace_state *state, |
|||
const char *filename ATTRIBUTE_UNUSED, int descriptor, |
|||
backtrace_error_callback error_callback, |
|||
void *data, fileline *fileline_fn) |
|||
{ |
|||
int ret; |
|||
int found_sym; |
|||
int found_dwarf; |
|||
fileline coff_fileline_fn; |
|||
|
|||
ret = coff_add (state, descriptor, error_callback, data, |
|||
&coff_fileline_fn, &found_sym, &found_dwarf); |
|||
if (!ret) |
|||
return 0; |
|||
|
|||
if (!state->threaded) |
|||
{ |
|||
if (found_sym) |
|||
state->syminfo_fn = coff_syminfo; |
|||
else if (state->syminfo_fn == NULL) |
|||
state->syminfo_fn = coff_nosyms; |
|||
} |
|||
else |
|||
{ |
|||
if (found_sym) |
|||
backtrace_atomic_store_pointer (&state->syminfo_fn, coff_syminfo); |
|||
else |
|||
__sync_bool_compare_and_swap (&state->syminfo_fn, NULL, coff_nosyms); |
|||
} |
|||
|
|||
if (!state->threaded) |
|||
{ |
|||
if (state->fileline_fn == NULL || state->fileline_fn == coff_nodebug) |
|||
*fileline_fn = coff_fileline_fn; |
|||
} |
|||
else |
|||
{ |
|||
fileline current_fn; |
|||
|
|||
current_fn = backtrace_atomic_load_pointer (&state->fileline_fn); |
|||
if (current_fn == NULL || current_fn == coff_nodebug) |
|||
*fileline_fn = coff_fileline_fn; |
|||
} |
|||
|
|||
return 1; |
|||
} |
@ -0,0 +1,100 @@ |
|||
/* posix.c -- POSIX file I/O routines for the backtrace library.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <errno.h> |
|||
#include <sys/types.h> |
|||
#include <sys/stat.h> |
|||
#include <fcntl.h> |
|||
#include <unistd.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
#ifndef O_BINARY |
|||
#define O_BINARY 0 |
|||
#endif |
|||
|
|||
#ifndef O_CLOEXEC |
|||
#define O_CLOEXEC 0 |
|||
#endif |
|||
|
|||
#ifndef FD_CLOEXEC |
|||
#define FD_CLOEXEC 1 |
|||
#endif |
|||
|
|||
/* Open a file for reading. */ |
|||
|
|||
int |
|||
backtrace_open (const char *filename, backtrace_error_callback error_callback, |
|||
void *data, int *does_not_exist) |
|||
{ |
|||
int descriptor; |
|||
|
|||
if (does_not_exist != NULL) |
|||
*does_not_exist = 0; |
|||
|
|||
descriptor = open (filename, (int) (O_RDONLY | O_BINARY | O_CLOEXEC)); |
|||
if (descriptor < 0) |
|||
{ |
|||
if (does_not_exist != NULL && errno == ENOENT) |
|||
*does_not_exist = 1; |
|||
else |
|||
error_callback (data, filename, errno); |
|||
return -1; |
|||
} |
|||
|
|||
#ifdef HAVE_FCNTL |
|||
/* Set FD_CLOEXEC just in case the kernel does not support
|
|||
O_CLOEXEC. It doesn't matter if this fails for some reason. |
|||
FIXME: At some point it should be safe to only do this if |
|||
O_CLOEXEC == 0. */ |
|||
fcntl (descriptor, F_SETFD, FD_CLOEXEC); |
|||
#endif |
|||
|
|||
return descriptor; |
|||
} |
|||
|
|||
/* Close DESCRIPTOR. */ |
|||
|
|||
int |
|||
backtrace_close (int descriptor, backtrace_error_callback error_callback, |
|||
void *data) |
|||
{ |
|||
if (close (descriptor) < 0) |
|||
{ |
|||
error_callback (data, "close", errno); |
|||
return 0; |
|||
} |
|||
return 1; |
|||
} |
@ -0,0 +1,92 @@ |
|||
/* print.c -- Print the current backtrace.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <stdio.h> |
|||
#include <string.h> |
|||
#include <sys/types.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
/* Passed to callbacks. */ |
|||
|
|||
struct print_data |
|||
{ |
|||
struct backtrace_state *state; |
|||
FILE *f; |
|||
}; |
|||
|
|||
/* Print one level of a backtrace. */ |
|||
|
|||
static int |
|||
print_callback (void *data, uintptr_t pc, const char *filename, int lineno, |
|||
const char *function) |
|||
{ |
|||
struct print_data *pdata = (struct print_data *) data; |
|||
|
|||
fprintf (pdata->f, "0x%lx %s\n\t%s:%d\n", |
|||
(unsigned long) pc, |
|||
function == NULL ? "???" : function, |
|||
filename == NULL ? "???" : filename, |
|||
lineno); |
|||
return 0; |
|||
} |
|||
|
|||
/* Print errors to stderr. */ |
|||
|
|||
static void |
|||
error_callback (void *data, const char *msg, int errnum) |
|||
{ |
|||
struct print_data *pdata = (struct print_data *) data; |
|||
|
|||
if (pdata->state->filename != NULL) |
|||
fprintf (stderr, "%s: ", pdata->state->filename); |
|||
fprintf (stderr, "libbacktrace: %s", msg); |
|||
if (errnum > 0) |
|||
fprintf (stderr, ": %s", strerror (errnum)); |
|||
fputc ('\n', stderr); |
|||
} |
|||
|
|||
/* Print a backtrace. */ |
|||
|
|||
void |
|||
backtrace_print (struct backtrace_state *state, int skip, FILE *f) |
|||
{ |
|||
struct print_data data; |
|||
|
|||
data.state = state; |
|||
data.f = f; |
|||
backtrace_full (state, skip + 1, print_callback, error_callback, |
|||
(void *) &data); |
|||
} |
@ -0,0 +1,96 @@ |
|||
/* read.c -- File views without mmap.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <errno.h> |
|||
#include <stdlib.h> |
|||
#include <sys/types.h> |
|||
#include <unistd.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
/* This file implements file views when mmap is not available. */ |
|||
|
|||
/* Create a view of SIZE bytes from DESCRIPTOR at OFFSET. */ |
|||
|
|||
int |
|||
backtrace_get_view (struct backtrace_state *state, int descriptor, |
|||
off_t offset, size_t size, |
|||
backtrace_error_callback error_callback, |
|||
void *data, struct backtrace_view *view) |
|||
{ |
|||
ssize_t got; |
|||
|
|||
if (lseek (descriptor, offset, SEEK_SET) < 0) |
|||
{ |
|||
error_callback (data, "lseek", errno); |
|||
return 0; |
|||
} |
|||
|
|||
view->base = backtrace_alloc (state, size, error_callback, data); |
|||
if (view->base == NULL) |
|||
return 0; |
|||
view->data = view->base; |
|||
view->len = size; |
|||
|
|||
got = read (descriptor, view->base, size); |
|||
if (got < 0) |
|||
{ |
|||
error_callback (data, "read", errno); |
|||
free (view->base); |
|||
return 0; |
|||
} |
|||
|
|||
if ((size_t) got < size) |
|||
{ |
|||
error_callback (data, "file too short", 0); |
|||
free (view->base); |
|||
return 0; |
|||
} |
|||
|
|||
return 1; |
|||
} |
|||
|
|||
/* Release a view read by backtrace_get_view. */ |
|||
|
|||
void |
|||
backtrace_release_view (struct backtrace_state *state, |
|||
struct backtrace_view *view, |
|||
backtrace_error_callback error_callback, |
|||
void *data) |
|||
{ |
|||
backtrace_free (state, view->base, view->len, error_callback, data); |
|||
view->data = NULL; |
|||
view->base = NULL; |
|||
} |
@ -0,0 +1,108 @@ |
|||
/* simple.c -- The backtrace_simple function.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include "unwind.h" |
|||
#include "backtrace.h" |
|||
|
|||
/* The simple_backtrace routine. */ |
|||
|
|||
/* Data passed through _Unwind_Backtrace. */ |
|||
|
|||
struct backtrace_simple_data |
|||
{ |
|||
/* Number of frames to skip. */ |
|||
int skip; |
|||
/* Library state. */ |
|||
struct backtrace_state *state; |
|||
/* Callback routine. */ |
|||
backtrace_simple_callback callback; |
|||
/* Error callback routine. */ |
|||
backtrace_error_callback error_callback; |
|||
/* Data to pass to callback routine. */ |
|||
void *data; |
|||
/* Value to return from backtrace. */ |
|||
int ret; |
|||
}; |
|||
|
|||
/* Unwind library callback routine. This is passd to
|
|||
_Unwind_Backtrace. */ |
|||
|
|||
static _Unwind_Reason_Code |
|||
simple_unwind (struct _Unwind_Context *context, void *vdata) |
|||
{ |
|||
struct backtrace_simple_data *bdata = (struct backtrace_simple_data *) vdata; |
|||
uintptr_t pc; |
|||
int ip_before_insn = 0; |
|||
|
|||
#ifdef HAVE_GETIPINFO |
|||
pc = _Unwind_GetIPInfo (context, &ip_before_insn); |
|||
#else |
|||
pc = _Unwind_GetIP (context); |
|||
#endif |
|||
|
|||
if (bdata->skip > 0) |
|||
{ |
|||
--bdata->skip; |
|||
return _URC_NO_REASON; |
|||
} |
|||
|
|||
if (!ip_before_insn) |
|||
--pc; |
|||
|
|||
bdata->ret = bdata->callback (bdata->data, pc); |
|||
|
|||
if (bdata->ret != 0) |
|||
return _URC_END_OF_STACK; |
|||
|
|||
return _URC_NO_REASON; |
|||
} |
|||
|
|||
/* Get a simple stack backtrace. */ |
|||
|
|||
int |
|||
backtrace_simple (struct backtrace_state *state, int skip, |
|||
backtrace_simple_callback callback, |
|||
backtrace_error_callback error_callback, void *data) |
|||
{ |
|||
struct backtrace_simple_data bdata; |
|||
|
|||
bdata.skip = skip + 1; |
|||
bdata.state = state; |
|||
bdata.callback = callback; |
|||
bdata.error_callback = error_callback; |
|||
bdata.data = data; |
|||
bdata.ret = 0; |
|||
_Unwind_Backtrace (simple_unwind, &bdata); |
|||
return bdata.ret; |
|||
} |
@ -0,0 +1,108 @@ |
|||
/* sort.c -- Sort without allocating memory
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <stddef.h> |
|||
#include <sys/types.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
/* The GNU glibc version of qsort allocates memory, which we must not
|
|||
do if we are invoked by a signal handler. So provide our own |
|||
sort. */ |
|||
|
|||
static void |
|||
swap (char *a, char *b, size_t size) |
|||
{ |
|||
size_t i; |
|||
|
|||
for (i = 0; i < size; i++, a++, b++) |
|||
{ |
|||
char t; |
|||
|
|||
t = *a; |
|||
*a = *b; |
|||
*b = t; |
|||
} |
|||
} |
|||
|
|||
void |
|||
backtrace_qsort (void *basearg, size_t count, size_t size, |
|||
int (*compar) (const void *, const void *)) |
|||
{ |
|||
char *base = (char *) basearg; |
|||
size_t i; |
|||
size_t mid; |
|||
|
|||
tail_recurse: |
|||
if (count < 2) |
|||
return; |
|||
|
|||
/* The symbol table and DWARF tables, which is all we use this
|
|||
routine for, tend to be roughly sorted. Pick the middle element |
|||
in the array as our pivot point, so that we are more likely to |
|||
cut the array in half for each recursion step. */ |
|||
swap (base, base + (count / 2) * size, size); |
|||
|
|||
mid = 0; |
|||
for (i = 1; i < count; i++) |
|||
{ |
|||
if ((*compar) (base, base + i * size) > 0) |
|||
{ |
|||
++mid; |
|||
if (i != mid) |
|||
swap (base + mid * size, base + i * size, size); |
|||
} |
|||
} |
|||
|
|||
if (mid > 0) |
|||
swap (base, base + mid * size, size); |
|||
|
|||
/* Recurse with the smaller array, loop with the larger one. That
|
|||
ensures that our maximum stack depth is log count. */ |
|||
if (2 * mid < count) |
|||
{ |
|||
backtrace_qsort (base, mid, size, compar); |
|||
base += (mid + 1) * size; |
|||
count -= mid + 1; |
|||
goto tail_recurse; |
|||
} |
|||
else |
|||
{ |
|||
backtrace_qsort (base + (mid + 1) * size, count - (mid + 1), |
|||
size, compar); |
|||
count = mid; |
|||
goto tail_recurse; |
|||
} |
|||
} |
@ -0,0 +1,72 @@ |
|||
/* state.c -- Create the backtrace state.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <string.h> |
|||
#include <sys/types.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "backtrace-supported.h" |
|||
#include "internal.h" |
|||
|
|||
/* Create the backtrace state. This will then be passed to all the
|
|||
other routines. */ |
|||
|
|||
struct backtrace_state * |
|||
backtrace_create_state (const char *filename, int threaded, |
|||
backtrace_error_callback error_callback, |
|||
void *data) |
|||
{ |
|||
struct backtrace_state init_state; |
|||
struct backtrace_state *state; |
|||
|
|||
#ifndef HAVE_SYNC_FUNCTIONS |
|||
if (threaded) |
|||
{ |
|||
error_callback (data, "backtrace library does not support threads", 0); |
|||
return NULL; |
|||
} |
|||
#endif |
|||
|
|||
memset (&init_state, 0, sizeof init_state); |
|||
init_state.filename = filename; |
|||
init_state.threaded = threaded; |
|||
|
|||
state = ((struct backtrace_state *) |
|||
backtrace_alloc (&init_state, sizeof *state, error_callback, data)); |
|||
if (state == NULL) |
|||
return NULL; |
|||
*state = init_state; |
|||
|
|||
return state; |
|||
} |
@ -0,0 +1,137 @@ |
|||
/* stest.c -- Test for libbacktrace internal sort function
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
#include <sys/types.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
/* Test the local qsort implementation. */ |
|||
|
|||
#define MAX 10 |
|||
|
|||
struct test |
|||
{ |
|||
size_t count; |
|||
int input[MAX]; |
|||
int output[MAX]; |
|||
}; |
|||
|
|||
static struct test tests[] = |
|||
{ |
|||
{ |
|||
10, |
|||
{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }, |
|||
{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 } |
|||
}, |
|||
{ |
|||
9, |
|||
{ 1, 2, 3, 4, 5, 6, 7, 8, 9 }, |
|||
{ 1, 2, 3, 4, 5, 6, 7, 8, 9 } |
|||
}, |
|||
{ |
|||
10, |
|||
{ 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 }, |
|||
{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }, |
|||
}, |
|||
{ |
|||
9, |
|||
{ 9, 8, 7, 6, 5, 4, 3, 2, 1 }, |
|||
{ 1, 2, 3, 4, 5, 6, 7, 8, 9 }, |
|||
}, |
|||
{ |
|||
10, |
|||
{ 2, 4, 6, 8, 10, 1, 3, 5, 7, 9 }, |
|||
{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }, |
|||
}, |
|||
{ |
|||
5, |
|||
{ 4, 5, 3, 1, 2 }, |
|||
{ 1, 2, 3, 4, 5 }, |
|||
}, |
|||
{ |
|||
5, |
|||
{ 1, 1, 1, 1, 1 }, |
|||
{ 1, 1, 1, 1, 1 }, |
|||
}, |
|||
{ |
|||
5, |
|||
{ 1, 1, 2, 1, 1 }, |
|||
{ 1, 1, 1, 1, 2 }, |
|||
}, |
|||
{ |
|||
5, |
|||
{ 2, 1, 1, 1, 1 }, |
|||
{ 1, 1, 1, 1, 2 }, |
|||
}, |
|||
}; |
|||
|
|||
static int |
|||
compare (const void *a, const void *b) |
|||
{ |
|||
const int *ai = (const int *) a; |
|||
const int *bi = (const int *) b; |
|||
|
|||
return *ai - *bi; |
|||
} |
|||
|
|||
int |
|||
main (int argc ATTRIBUTE_UNUSED, char **argv ATTRIBUTE_UNUSED) |
|||
{ |
|||
int failures; |
|||
size_t i; |
|||
int a[MAX]; |
|||
|
|||
failures = 0; |
|||
for (i = 0; i < sizeof tests / sizeof tests[0]; i++) |
|||
{ |
|||
memcpy (a, tests[i].input, tests[i].count * sizeof (int)); |
|||
backtrace_qsort (a, tests[i].count, sizeof (int), compare); |
|||
if (memcmp (a, tests[i].output, tests[i].count * sizeof (int)) != 0) |
|||
{ |
|||
size_t j; |
|||
|
|||
fprintf (stderr, "test %d failed:", (int) i); |
|||
for (j = 0; j < tests[i].count; j++) |
|||
fprintf (stderr, " %d", a[j]); |
|||
fprintf (stderr, "\n"); |
|||
++failures; |
|||
} |
|||
} |
|||
|
|||
exit (failures > 0 ? EXIT_FAILURE : EXIT_SUCCESS); |
|||
} |
@ -0,0 +1,234 @@ |
|||
/* testlib.c -- test functions for libbacktrace library
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include <assert.h> |
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
|
|||
#include "filenames.h" |
|||
|
|||
#include "backtrace.h" |
|||
|
|||
#include "testlib.h" |
|||
|
|||
/* The backtrace state. */ |
|||
|
|||
void *state; |
|||
|
|||
/* The number of failures. */ |
|||
|
|||
int failures; |
|||
|
|||
/* Return the base name in a path. */ |
|||
|
|||
const char * |
|||
base (const char *p) |
|||
{ |
|||
const char *last; |
|||
const char *s; |
|||
|
|||
last = NULL; |
|||
for (s = p; *s != '\0'; ++s) |
|||
{ |
|||
if (IS_DIR_SEPARATOR (*s)) |
|||
last = s + 1; |
|||
} |
|||
return last != NULL ? last : p; |
|||
} |
|||
|
|||
/* Check an entry in a struct info array. */ |
|||
|
|||
void |
|||
check (const char *name, int index, const struct info *all, int want_lineno, |
|||
const char *want_function, const char *want_file, int *failed) |
|||
{ |
|||
if (*failed) |
|||
return; |
|||
if (all[index].filename == NULL || all[index].function == NULL) |
|||
{ |
|||
fprintf (stderr, "%s: [%d]: missing file name or function name\n", |
|||
name, index); |
|||
*failed = 1; |
|||
return; |
|||
} |
|||
if (strcmp (base (all[index].filename), want_file) != 0) |
|||
{ |
|||
fprintf (stderr, "%s: [%d]: got %s expected %s\n", name, index, |
|||
all[index].filename, want_file); |
|||
*failed = 1; |
|||
} |
|||
if (all[index].lineno != want_lineno) |
|||
{ |
|||
fprintf (stderr, "%s: [%d]: got %d expected %d\n", name, index, |
|||
all[index].lineno, want_lineno); |
|||
*failed = 1; |
|||
} |
|||
if (strcmp (all[index].function, want_function) != 0) |
|||
{ |
|||
fprintf (stderr, "%s: [%d]: got %s expected %s\n", name, index, |
|||
all[index].function, want_function); |
|||
*failed = 1; |
|||
} |
|||
} |
|||
|
|||
/* The backtrace callback function. */ |
|||
|
|||
int |
|||
callback_one (void *vdata, uintptr_t pc ATTRIBUTE_UNUSED, |
|||
const char *filename, int lineno, const char *function) |
|||
{ |
|||
struct bdata *data = (struct bdata *) vdata; |
|||
struct info *p; |
|||
|
|||
if (data->index >= data->max) |
|||
{ |
|||
fprintf (stderr, "callback_one: callback called too many times\n"); |
|||
data->failed = 1; |
|||
return 1; |
|||
} |
|||
|
|||
p = &data->all[data->index]; |
|||
if (filename == NULL) |
|||
p->filename = NULL; |
|||
else |
|||
{ |
|||
p->filename = strdup (filename); |
|||
assert (p->filename != NULL); |
|||
} |
|||
p->lineno = lineno; |
|||
if (function == NULL) |
|||
p->function = NULL; |
|||
else |
|||
{ |
|||
p->function = strdup (function); |
|||
assert (p->function != NULL); |
|||
} |
|||
++data->index; |
|||
|
|||
return 0; |
|||
} |
|||
|
|||
/* An error callback passed to backtrace. */ |
|||
|
|||
void |
|||
error_callback_one (void *vdata, const char *msg, int errnum) |
|||
{ |
|||
struct bdata *data = (struct bdata *) vdata; |
|||
|
|||
fprintf (stderr, "%s", msg); |
|||
if (errnum > 0) |
|||
fprintf (stderr, ": %s", strerror (errnum)); |
|||
fprintf (stderr, "\n"); |
|||
data->failed = 1; |
|||
} |
|||
|
|||
/* The backtrace_simple callback function. */ |
|||
|
|||
int |
|||
callback_two (void *vdata, uintptr_t pc) |
|||
{ |
|||
struct sdata *data = (struct sdata *) vdata; |
|||
|
|||
if (data->index >= data->max) |
|||
{ |
|||
fprintf (stderr, "callback_two: callback called too many times\n"); |
|||
data->failed = 1; |
|||
return 1; |
|||
} |
|||
|
|||
data->addrs[data->index] = pc; |
|||
++data->index; |
|||
|
|||
return 0; |
|||
} |
|||
|
|||
/* An error callback passed to backtrace_simple. */ |
|||
|
|||
void |
|||
error_callback_two (void *vdata, const char *msg, int errnum) |
|||
{ |
|||
struct sdata *data = (struct sdata *) vdata; |
|||
|
|||
fprintf (stderr, "%s", msg); |
|||
if (errnum > 0) |
|||
fprintf (stderr, ": %s", strerror (errnum)); |
|||
fprintf (stderr, "\n"); |
|||
data->failed = 1; |
|||
} |
|||
|
|||
/* The backtrace_syminfo callback function. */ |
|||
|
|||
void |
|||
callback_three (void *vdata, uintptr_t pc ATTRIBUTE_UNUSED, |
|||
const char *symname, uintptr_t symval, |
|||
uintptr_t symsize) |
|||
{ |
|||
struct symdata *data = (struct symdata *) vdata; |
|||
|
|||
if (symname == NULL) |
|||
data->name = NULL; |
|||
else |
|||
{ |
|||
data->name = strdup (symname); |
|||
assert (data->name != NULL); |
|||
} |
|||
data->val = symval; |
|||
data->size = symsize; |
|||
} |
|||
|
|||
/* The backtrace_syminfo error callback function. */ |
|||
|
|||
void |
|||
error_callback_three (void *vdata, const char *msg, int errnum) |
|||
{ |
|||
struct symdata *data = (struct symdata *) vdata; |
|||
|
|||
fprintf (stderr, "%s", msg); |
|||
if (errnum > 0) |
|||
fprintf (stderr, ": %s", strerror (errnum)); |
|||
fprintf (stderr, "\n"); |
|||
data->failed = 1; |
|||
} |
|||
|
|||
/* The backtrace_create_state error callback function. */ |
|||
|
|||
void |
|||
error_callback_create (void *data ATTRIBUTE_UNUSED, const char *msg, |
|||
int errnum) |
|||
{ |
|||
fprintf (stderr, "%s", msg); |
|||
if (errnum > 0) |
|||
fprintf (stderr, ": %s", strerror (errnum)); |
|||
fprintf (stderr, "\n"); |
|||
exit (EXIT_FAILURE); |
|||
} |
@ -0,0 +1,110 @@ |
|||
/* testlib.h -- Header for test functions for libbacktrace library
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#ifndef LIBBACKTRACE_TESTLIB_H |
|||
#define LIBBACKTRACE_TESTLIB_H |
|||
|
|||
/* Portable attribute syntax. Actually some of these tests probably
|
|||
won't work if the attributes are not recognized. */ |
|||
|
|||
#ifndef GCC_VERSION |
|||
# define GCC_VERSION (__GNUC__ * 1000 + __GNUC_MINOR__) |
|||
#endif |
|||
|
|||
#if (GCC_VERSION < 2007) |
|||
# define __attribute__(x) |
|||
#endif |
|||
|
|||
#ifndef ATTRIBUTE_UNUSED |
|||
# define ATTRIBUTE_UNUSED __attribute__ ((__unused__)) |
|||
#endif |
|||
|
|||
/* Used to collect backtrace info. */ |
|||
|
|||
struct info |
|||
{ |
|||
char *filename; |
|||
int lineno; |
|||
char *function; |
|||
}; |
|||
|
|||
/* Passed to backtrace callback function. */ |
|||
|
|||
struct bdata |
|||
{ |
|||
struct info *all; |
|||
size_t index; |
|||
size_t max; |
|||
int failed; |
|||
}; |
|||
|
|||
/* Passed to backtrace_simple callback function. */ |
|||
|
|||
struct sdata |
|||
{ |
|||
uintptr_t *addrs; |
|||
size_t index; |
|||
size_t max; |
|||
int failed; |
|||
}; |
|||
|
|||
/* Passed to backtrace_syminfo callback function. */ |
|||
|
|||
struct symdata |
|||
{ |
|||
const char *name; |
|||
uintptr_t val, size; |
|||
int failed; |
|||
}; |
|||
|
|||
/* The backtrace state. */ |
|||
|
|||
extern void *state; |
|||
|
|||
/* The number of failures. */ |
|||
|
|||
extern int failures; |
|||
|
|||
extern const char *base (const char *p); |
|||
extern void check (const char *name, int index, const struct info *all, |
|||
int want_lineno, const char *want_function, |
|||
const char *want_file, int *failed); |
|||
extern int callback_one (void *, uintptr_t, const char *, int, const char *); |
|||
extern void error_callback_one (void *, const char *, int); |
|||
extern int callback_two (void *, uintptr_t); |
|||
extern void error_callback_two (void *, const char *, int); |
|||
extern void callback_three (void *, uintptr_t, const char *, uintptr_t, |
|||
uintptr_t); |
|||
extern void error_callback_three (void *, const char *, int); |
|||
extern void error_callback_create (void *, const char *, int); |
|||
|
|||
#endif /* !defined(LIBBACKTRACE_TESTLIB_H) */ |
@ -0,0 +1,161 @@ |
|||
/* ttest.c -- Test for libbacktrace library
|
|||
Copyright (C) 2017-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
/* Test using the libbacktrace library from multiple threads. */ |
|||
|
|||
#include <assert.h> |
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
|
|||
#include <pthread.h> |
|||
|
|||
#include "filenames.h" |
|||
|
|||
#include "backtrace.h" |
|||
#include "backtrace-supported.h" |
|||
|
|||
#include "testlib.h" |
|||
|
|||
static int f2 (int) __attribute__ ((noinline)); |
|||
static int f3 (int, int) __attribute__ ((noinline)); |
|||
|
|||
/* Test that a simple backtrace works. This is called via
|
|||
pthread_create. It returns the number of failures, as void *. */ |
|||
|
|||
static void * |
|||
test1_thread (void *arg ATTRIBUTE_UNUSED) |
|||
{ |
|||
/* Returning a value here and elsewhere avoids a tailcall which
|
|||
would mess up the backtrace. */ |
|||
return (void *) (uintptr_t) (f2 (__LINE__) - 2); |
|||
} |
|||
|
|||
static int |
|||
f2 (int f1line) |
|||
{ |
|||
return f3 (f1line, __LINE__) + 2; |
|||
} |
|||
|
|||
static int |
|||
f3 (int f1line, int f2line) |
|||
{ |
|||
struct info all[20]; |
|||
struct bdata data; |
|||
int f3line; |
|||
int i; |
|||
|
|||
data.all = &all[0]; |
|||
data.index = 0; |
|||
data.max = 20; |
|||
data.failed = 0; |
|||
|
|||
f3line = __LINE__ + 1; |
|||
i = backtrace_full (state, 0, callback_one, error_callback_one, &data); |
|||
|
|||
if (i != 0) |
|||
{ |
|||
fprintf (stderr, "test1: unexpected return value %d\n", i); |
|||
data.failed = 1; |
|||
} |
|||
|
|||
if (data.index < 3) |
|||
{ |
|||
fprintf (stderr, |
|||
"test1: not enough frames; got %zu, expected at least 3\n", |
|||
data.index); |
|||
data.failed = 1; |
|||
} |
|||
|
|||
check ("test1", 0, all, f3line, "f3", "ttest.c", &data.failed); |
|||
check ("test1", 1, all, f2line, "f2", "ttest.c", &data.failed); |
|||
check ("test1", 2, all, f1line, "test1_thread", "ttest.c", &data.failed); |
|||
|
|||
return data.failed; |
|||
} |
|||
|
|||
/* Run the test with 10 threads simultaneously. */ |
|||
|
|||
#define THREAD_COUNT 10 |
|||
|
|||
static void test1 (void) __attribute__ ((unused)); |
|||
|
|||
static void |
|||
test1 (void) |
|||
{ |
|||
pthread_t atid[THREAD_COUNT]; |
|||
int i; |
|||
int errnum; |
|||
int this_fail; |
|||
void *ret; |
|||
|
|||
for (i = 0; i < THREAD_COUNT; i++) |
|||
{ |
|||
errnum = pthread_create (&atid[i], NULL, test1_thread, NULL); |
|||
if (errnum != 0) |
|||
{ |
|||
fprintf (stderr, "pthread_create %d: %s\n", i, strerror (errnum)); |
|||
exit (EXIT_FAILURE); |
|||
} |
|||
} |
|||
|
|||
this_fail = 0; |
|||
for (i = 0; i < THREAD_COUNT; i++) |
|||
{ |
|||
errnum = pthread_join (atid[i], &ret); |
|||
if (errnum != 0) |
|||
{ |
|||
fprintf (stderr, "pthread_join %d: %s\n", i, strerror (errnum)); |
|||
exit (EXIT_FAILURE); |
|||
} |
|||
this_fail += (int) (uintptr_t) ret; |
|||
} |
|||
|
|||
printf ("%s: threaded backtrace_full noinline\n", this_fail > 0 ? "FAIL" : "PASS"); |
|||
|
|||
failures += this_fail; |
|||
} |
|||
|
|||
int |
|||
main (int argc ATTRIBUTE_UNUSED, char **argv) |
|||
{ |
|||
state = backtrace_create_state (argv[0], BACKTRACE_SUPPORTS_THREADS, |
|||
error_callback_create, NULL); |
|||
|
|||
#if BACKTRACE_SUPPORTED |
|||
#if BACKTRACE_SUPPORTS_THREADS |
|||
test1 (); |
|||
#endif |
|||
#endif |
|||
|
|||
exit (failures ? EXIT_FAILURE : EXIT_SUCCESS); |
|||
} |
@ -0,0 +1,65 @@ |
|||
/* unknown.c -- used when backtrace configury does not know file format.
|
|||
Copyright (C) 2012-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <sys/types.h> |
|||
|
|||
#include "backtrace.h" |
|||
#include "internal.h" |
|||
|
|||
/* A trivial routine that always fails to find fileline data. */ |
|||
|
|||
static int |
|||
unknown_fileline (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
uintptr_t pc, backtrace_full_callback callback, |
|||
backtrace_error_callback error_callback ATTRIBUTE_UNUSED, |
|||
void *data) |
|||
|
|||
{ |
|||
return callback (data, pc, NULL, 0, NULL); |
|||
} |
|||
|
|||
/* Initialize the backtrace data when we don't know how to read the
|
|||
debug info. */ |
|||
|
|||
int |
|||
backtrace_initialize (struct backtrace_state *state ATTRIBUTE_UNUSED, |
|||
const char *filename ATTRIBUTE_UNUSED, |
|||
int descriptor ATTRIBUTE_UNUSED, |
|||
backtrace_error_callback error_callback ATTRIBUTE_UNUSED, |
|||
void *data ATTRIBUTE_UNUSED, fileline *fileline_fn) |
|||
{ |
|||
state->fileline_data = NULL; |
|||
*fileline_fn = unknown_fileline; |
|||
return 1; |
|||
} |
File diff suppressed because it is too large
@ -0,0 +1,537 @@ |
|||
/* ztest.c -- Test for libbacktrace inflate code.
|
|||
Copyright (C) 2017-2018 Free Software Foundation, Inc. |
|||
Written by Ian Lance Taylor, Google. |
|||
|
|||
Redistribution and use in source and binary forms, with or without |
|||
modification, are permitted provided that the following conditions are |
|||
met: |
|||
|
|||
(1) Redistributions of source code must retain the above copyright |
|||
notice, this list of conditions and the following disclaimer. |
|||
|
|||
(2) Redistributions in binary form must reproduce the above copyright |
|||
notice, this list of conditions and the following disclaimer in |
|||
the documentation and/or other materials provided with the |
|||
distribution. |
|||
|
|||
(3) The name of the author may not be used to |
|||
endorse or promote products derived from this software without |
|||
specific prior written permission. |
|||
|
|||
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
|||
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|||
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, |
|||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
|||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
|||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
|||
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|||
POSSIBILITY OF SUCH DAMAGE. */ |
|||
|
|||
#include "config.h" |
|||
|
|||
#include <errno.h> |
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
#include <time.h> |
|||
#include <sys/types.h> |
|||
#include <sys/stat.h> |
|||
|
|||
#ifdef HAVE_ZLIB |
|||
#include <zlib.h> |
|||
#endif |
|||
|
|||
#include "backtrace.h" |
|||
#include "backtrace-supported.h" |
|||
|
|||
#include "internal.h" |
|||
#include "testlib.h" |
|||
|
|||
#ifndef HAVE_CLOCK_GETTIME |
|||
|
|||
typedef int xclockid_t; |
|||
|
|||
static int |
|||
xclock_gettime (xclockid_t id ATTRIBUTE_UNUSED, |
|||
struct timespec *ts ATTRIBUTE_UNUSED) |
|||
{ |
|||
errno = EINVAL; |
|||
return -1; |
|||
} |
|||
|
|||
#define clockid_t xclockid_t |
|||
#define clock_gettime xclock_gettime |
|||
#undef CLOCK_REALTIME |
|||
#define CLOCK_REALTIME 0 |
|||
|
|||
#endif /* !defined(HAVE_CLOCK_GETTIME) */ |
|||
|
|||
#ifdef CLOCK_PROCESS_CPUTIME_ID |
|||
#define ZLIB_CLOCK_GETTIME_ARG CLOCK_PROCESS_CPUTIME_ID |
|||
#else |
|||
#define ZLIB_CLOCK_GETTIME_ARG CLOCK_REALTIME |
|||
#endif |
|||
|
|||
/* Some tests for the local zlib inflation code. */ |
|||
|
|||
struct zlib_test |
|||
{ |
|||
const char *name; |
|||
const char *uncompressed; |
|||
size_t uncompressed_len; |
|||
const char *compressed; |
|||
size_t compressed_len; |
|||
}; |
|||
|
|||
/* Error callback. */ |
|||
|
|||
static void |
|||
error_callback_compress (void *vdata, const char *msg, int errnum) |
|||
{ |
|||
fprintf (stderr, "%s", msg); |
|||
if (errnum > 0) |
|||
fprintf (stderr, ": %s", strerror (errnum)); |
|||
fprintf (stderr, "\n"); |
|||
exit (EXIT_FAILURE); |
|||
} |
|||
|
|||
static const struct zlib_test tests[] = |
|||
{ |
|||
{ |
|||
"empty", |
|||
"", |
|||
0, |
|||
"\x78\x9c\x03\x00\x00\x00\x00\x01", |
|||
8, |
|||
}, |
|||
{ |
|||
"hello", |
|||
"hello, world\n", |
|||
0, |
|||
("\x78\x9c\xca\x48\xcd\xc9\xc9\xd7\x51\x28\xcf" |
|||
"\x2f\xca\x49\xe1\x02\x04\x00\x00\xff\xff\x21\xe7\x04\x93"), |
|||
25, |
|||
}, |
|||
{ |
|||
"goodbye", |
|||
"goodbye, world", |
|||
0, |
|||
("\x78\x9c\x4b\xcf\xcf\x4f\x49\xaa" |
|||
"\x4c\xd5\x51\x28\xcf\x2f\xca\x49" |
|||
"\x01\x00\x28\xa5\x05\x5e"), |
|||
22, |
|||
}, |
|||
{ |
|||
"ranges", |
|||
("\xcc\x11\x00\x00\x00\x00\x00\x00\xd5\x13\x00\x00\x00\x00\x00\x00" |
|||
"\x1c\x14\x00\x00\x00\x00\x00\x00\x72\x14\x00\x00\x00\x00\x00\x00" |
|||
"\x9d\x14\x00\x00\x00\x00\x00\x00\xd5\x14\x00\x00\x00\x00\x00\x00" |
|||
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00" |
|||
"\xfb\x12\x00\x00\x00\x00\x00\x00\x09\x13\x00\x00\x00\x00\x00\x00" |
|||
"\x0c\x13\x00\x00\x00\x00\x00\x00\xcb\x13\x00\x00\x00\x00\x00\x00" |
|||
"\x29\x14\x00\x00\x00\x00\x00\x00\x4e\x14\x00\x00\x00\x00\x00\x00" |
|||
"\x9d\x14\x00\x00\x00\x00\x00\x00\xd5\x14\x00\x00\x00\x00\x00\x00" |
|||
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00" |
|||
"\xfb\x12\x00\x00\x00\x00\x00\x00\x09\x13\x00\x00\x00\x00\x00\x00" |
|||
"\x67\x13\x00\x00\x00\x00\x00\x00\xcb\x13\x00\x00\x00\x00\x00\x00" |
|||
"\x9d\x14\x00\x00\x00\x00\x00\x00\xd5\x14\x00\x00\x00\x00\x00\x00" |
|||
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00" |
|||
"\x5f\x0b\x00\x00\x00\x00\x00\x00\x6c\x0b\x00\x00\x00\x00\x00\x00" |
|||
"\x7d\x0b\x00\x00\x00\x00\x00\x00\x7e\x0c\x00\x00\x00\x00\x00\x00" |
|||
"\x38\x0f\x00\x00\x00\x00\x00\x00\x5c\x0f\x00\x00\x00\x00\x00\x00" |
|||
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00" |
|||
"\x83\x0c\x00\x00\x00\x00\x00\x00\xfa\x0c\x00\x00\x00\x00\x00\x00" |
|||
"\xfd\x0d\x00\x00\x00\x00\x00\x00\xef\x0e\x00\x00\x00\x00\x00\x00" |
|||
"\x14\x0f\x00\x00\x00\x00\x00\x00\x38\x0f\x00\x00\x00\x00\x00\x00" |
|||
"\x9f\x0f\x00\x00\x00\x00\x00\x00\xac\x0f\x00\x00\x00\x00\x00\x00" |
|||
"\xdb\x0f\x00\x00\x00\x00\x00\x00\xff\x0f\x00\x00\x00\x00\x00\x00" |
|||
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00" |
|||
"\xfd\x0d\x00\x00\x00\x00\x00\x00\xd8\x0e\x00\x00\x00\x00\x00\x00" |
|||
"\x9f\x0f\x00\x00\x00\x00\x00\x00\xac\x0f\x00\x00\x00\x00\x00\x00" |
|||
"\xdb\x0f\x00\x00\x00\x00\x00\x00\xff\x0f\x00\x00\x00\x00\x00\x00" |
|||
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00" |
|||
"\xfa\x0c\x00\x00\x00\x00\x00\x00\xea\x0d\x00\x00\x00\x00\x00\x00" |
|||
"\xef\x0e\x00\x00\x00\x00\x00\x00\x14\x0f\x00\x00\x00\x00\x00\x00" |
|||
"\x5c\x0f\x00\x00\x00\x00\x00\x00\x9f\x0f\x00\x00\x00\x00\x00\x00" |
|||
"\xac\x0f\x00\x00\x00\x00\x00\x00\xdb\x0f\x00\x00\x00\x00\x00\x00" |
|||
"\xff\x0f\x00\x00\x00\x00\x00\x00\x2c\x10\x00\x00\x00\x00\x00\x00" |
|||
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00" |
|||
"\x60\x11\x00\x00\x00\x00\x00\x00\xd1\x16\x00\x00\x00\x00\x00\x00" |
|||
"\x40\x0b\x00\x00\x00\x00\x00\x00\x2c\x10\x00\x00\x00\x00\x00\x00" |
|||
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00" |
|||
"\x7a\x00\x00\x00\x00\x00\x00\x00\xb6\x00\x00\x00\x00\x00\x00\x00" |
|||
"\x9f\x01\x00\x00\x00\x00\x00\x00\xa7\x01\x00\x00\x00\x00\x00\x00" |
|||
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00" |
|||
"\x7a\x00\x00\x00\x00\x00\x00\x00\xa9\x00\x00\x00\x00\x00\x00\x00" |
|||
"\x9f\x01\x00\x00\x00\x00\x00\x00\xa7\x01\x00\x00\x00\x00\x00\x00" |
|||
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"), |
|||
672, |
|||
("\x78\x9c\x3b\x23\xc8\x00\x06\x57\x85\x21\xb4\x8c\x08\x84\x2e\x82" |
|||
"\xd2\x73\xa1\xf4\x55\x28\x8d\x0e\x7e\x0b\x41\x68\x4e\xa8\x7e\x1e" |
|||
"\x28\x7d\x1a\x4a\x6b\x42\xf5\xf9\x91\x69\x5e\x3a\x9a\x79\x84\xf4" |
|||
"\xc7\x73\x43\xe8\x1c\x28\x5d\x0b\xa5\xeb\x78\x20\xb4\x05\x3f\x84" |
|||
"\x8e\xe1\xc7\xae\xbf\x19\xaa\xee\x17\x94\xfe\xcb\x0b\xa1\xdf\xf3" |
|||
"\x41\x68\x11\x7e\x54\x73\xe6\x43\xe9\x35\x50\xfa\x36\x94\xfe\x8f" |
|||
"\xc3\x7c\x98\x79\x37\xf8\xc8\xd3\x0f\x73\xd7\x2b\x1c\xee\x8a\x21" |
|||
"\xd2\x5d\x3a\x02\xd8\xcd\x4f\x80\xa6\x87\x8b\x62\x10\xda\x81\x1b" |
|||
"\xbf\xfa\x2a\x28\xbd\x0d\x4a\xcf\x67\x84\xd0\xcb\x19\xf1\xab\x5f" |
|||
"\x49\xa4\x7a\x00\x48\x97\x29\xd4"), |
|||
152, |
|||
} |
|||
}; |
|||
|
|||
/* Test the hand coded samples. */ |
|||
|
|||
static void |
|||
test_samples (struct backtrace_state *state) |
|||
{ |
|||
size_t i; |
|||
|
|||
for (i = 0; i < sizeof tests / sizeof tests[0]; ++i) |
|||
{ |
|||
char *p; |
|||
size_t v; |
|||
size_t j; |
|||
unsigned char *uncompressed; |
|||
size_t uncompressed_len; |
|||
|
|||
p = malloc (12 + tests[i].compressed_len); |
|||
memcpy (p, "ZLIB", 4); |
|||
v = tests[i].uncompressed_len; |
|||
if (v == 0) |
|||
v = strlen (tests[i].uncompressed); |
|||
for (j = 0; j < 8; ++j) |
|||
p[j + 4] = (v >> ((7 - j) * 8)) & 0xff; |
|||
memcpy (p + 12, tests[i].compressed, tests[i].compressed_len); |
|||
uncompressed = NULL; |
|||
uncompressed_len = 0; |
|||
if (!backtrace_uncompress_zdebug (state, (unsigned char *) p, |
|||
tests[i].compressed_len + 12, |
|||
error_callback_compress, NULL, |
|||
&uncompressed, &uncompressed_len)) |
|||
{ |
|||
fprintf (stderr, "test %s: uncompress failed\n", tests[i].name); |
|||
++failures; |
|||
} |
|||
else |
|||
{ |
|||
if (uncompressed_len != v) |
|||
{ |
|||
fprintf (stderr, |
|||
"test %s: got uncompressed length %zu, want %zu\n", |
|||
tests[i].name, uncompressed_len, v); |
|||
++failures; |
|||
} |
|||
else if (memcmp (tests[i].uncompressed, uncompressed, v) != 0) |
|||
{ |
|||
size_t j; |
|||
|
|||
fprintf (stderr, "test %s: uncompressed data mismatch\n", |
|||
tests[i].name); |
|||
for (j = 0; j < v; ++j) |
|||
if (tests[i].uncompressed[j] != uncompressed[j]) |
|||
fprintf (stderr, " %zu: got %#x want %#x\n", j, |
|||
uncompressed[j], tests[i].uncompressed[j]); |
|||
++failures; |
|||
} |
|||
else |
|||
printf ("PASS: inflate %s\n", tests[i].name); |
|||
|
|||
backtrace_free (state, uncompressed, uncompressed_len, |
|||
error_callback_compress, NULL); |
|||
} |
|||
} |
|||
} |
|||
|
|||
#ifdef HAVE_ZLIB |
|||
|
|||
/* Given a set of TRIALS timings, discard the lowest and highest
|
|||
values and return the mean average of the rest. */ |
|||
|
|||
static size_t |
|||
average_time (const size_t *times, size_t trials) |
|||
{ |
|||
size_t imax; |
|||
size_t max; |
|||
size_t imin; |
|||
size_t min; |
|||
size_t i; |
|||
size_t sum; |
|||
|
|||
imin = 0; |
|||
imax = 0; |
|||
min = times[0]; |
|||
max = times[0]; |
|||
for (i = 1; i < trials; ++i) |
|||
{ |
|||
if (times[i] < min) |
|||
{ |
|||
imin = i; |
|||
min = times[i]; |
|||
} |
|||
if (times[i] > max) |
|||
{ |
|||
imax = i; |
|||
max = times[i]; |
|||
} |
|||
} |
|||
|
|||
sum = 0; |
|||
for (i = 0; i < trials; ++i) |
|||
{ |
|||
if (i != imax && i != imin) |
|||
sum += times[i]; |
|||
} |
|||
return sum / (trials - 2); |
|||
} |
|||
|
|||
#endif |
|||
|
|||
/* Test a larger text, if available. */ |
|||
|
|||
static void |
|||
test_large (struct backtrace_state *state) |
|||
{ |
|||
#ifdef HAVE_ZLIB |
|||
unsigned char *orig_buf; |
|||
size_t orig_bufsize; |
|||
size_t i; |
|||
char *compressed_buf; |
|||
size_t compressed_bufsize; |
|||
unsigned long compress_sizearg; |
|||
unsigned char *uncompressed_buf; |
|||
size_t uncompressed_bufsize; |
|||
int r; |
|||
clockid_t cid; |
|||
struct timespec ts1; |
|||
struct timespec ts2; |
|||
size_t ctime; |
|||
size_t ztime; |
|||
const size_t trials = 16; |
|||
size_t ctimes[16]; |
|||
size_t ztimes[16]; |
|||
static const char * const names[] = { |
|||
"Mark.Twain-Tom.Sawyer.txt", |
|||
"../libgo/go/compress/testdata/Mark.Twain-Tom.Sawyer.txt" |
|||
}; |
|||
|
|||
orig_buf = NULL; |
|||
orig_bufsize = 0; |
|||
uncompressed_buf = NULL; |
|||
compressed_buf = NULL; |
|||
|
|||
for (i = 0; i < sizeof names / sizeof names[0]; ++i) |
|||
{ |
|||
size_t len; |
|||
char *namebuf; |
|||
FILE *e; |
|||
struct stat st; |
|||
char *rbuf; |
|||
size_t got; |
|||
|
|||
len = strlen (SRCDIR) + strlen (names[i]) + 2; |
|||
namebuf = malloc (len); |
|||
if (namebuf == NULL) |
|||
{ |
|||
perror ("malloc"); |
|||
goto fail; |
|||
} |
|||
snprintf (namebuf, len, "%s/%s", SRCDIR, names[i]); |
|||
e = fopen (namebuf, "r"); |
|||
free (namebuf); |
|||
if (e == NULL) |
|||
continue; |
|||
if (fstat (fileno (e), &st) < 0) |
|||
{ |
|||
perror ("fstat"); |
|||
fclose (e); |
|||
continue; |
|||
} |
|||
rbuf = malloc (st.st_size); |
|||
if (rbuf == NULL) |
|||
{ |
|||
perror ("malloc"); |
|||
goto fail; |
|||
} |
|||
got = fread (rbuf, 1, st.st_size, e); |
|||
fclose (e); |
|||
if (got > 0) |
|||
{ |
|||
orig_buf = rbuf; |
|||
orig_bufsize = got; |
|||
break; |
|||
} |
|||
free (rbuf); |
|||
} |
|||
|
|||
if (orig_buf == NULL) |
|||
{ |
|||
/* We couldn't find an input file. */ |
|||
printf ("UNSUPPORTED: inflate large\n"); |
|||
return; |
|||
} |
|||
|
|||
compressed_bufsize = compressBound (orig_bufsize) + 12; |
|||
compressed_buf = malloc (compressed_bufsize); |
|||
if (compressed_buf == NULL) |
|||
{ |
|||
perror ("malloc"); |
|||
goto fail; |
|||
} |
|||
|
|||
compress_sizearg = compressed_bufsize - 12; |
|||
r = compress (compressed_buf + 12, &compress_sizearg, |
|||
orig_buf, orig_bufsize); |
|||
if (r != Z_OK) |
|||
{ |
|||
fprintf (stderr, "zlib compress failed: %d\n", r); |
|||
goto fail; |
|||
} |
|||
|
|||
compressed_bufsize = compress_sizearg + 12; |
|||
|
|||
/* Prepare the header that our library expects. */ |
|||
memcpy (compressed_buf, "ZLIB", 4); |
|||
for (i = 0; i < 8; ++i) |
|||
compressed_buf[i + 4] = (orig_bufsize >> ((7 - i) * 8)) & 0xff; |
|||
|
|||
uncompressed_buf = malloc (orig_bufsize); |
|||
if (uncompressed_buf == NULL) |
|||
{ |
|||
perror ("malloc"); |
|||
goto fail; |
|||
} |
|||
uncompressed_bufsize = orig_bufsize; |
|||
|
|||
if (!backtrace_uncompress_zdebug (state, compressed_buf, compressed_bufsize, |
|||
error_callback_compress, NULL, |
|||
&uncompressed_buf, &uncompressed_bufsize)) |
|||
{ |
|||
fprintf (stderr, "inflate large: backtrace_uncompress_zdebug failed\n"); |
|||
goto fail; |
|||
} |
|||
|
|||
if (uncompressed_bufsize != orig_bufsize) |
|||
{ |
|||
fprintf (stderr, |
|||
"inflate large: got uncompressed length %zu, want %zu\n", |
|||
uncompressed_bufsize, orig_bufsize); |
|||
goto fail; |
|||
} |
|||
|
|||
if (memcmp (uncompressed_buf, orig_buf, uncompressed_bufsize) != 0) |
|||
{ |
|||
fprintf (stderr, "inflate large: uncompressed data mismatch\n"); |
|||
goto fail; |
|||
} |
|||
|
|||
printf ("PASS: inflate large\n"); |
|||
|
|||
for (i = 0; i < trials; ++i) |
|||
{ |
|||
unsigned long uncompress_sizearg; |
|||
|
|||
cid = ZLIB_CLOCK_GETTIME_ARG; |
|||
if (clock_gettime (cid, &ts1) < 0) |
|||
{ |
|||
if (errno == EINVAL) |
|||
return; |
|||
perror ("clock_gettime"); |
|||
return; |
|||
} |
|||
|
|||
if (!backtrace_uncompress_zdebug (state, compressed_buf, |
|||
compressed_bufsize, |
|||
error_callback_compress, NULL, |
|||
&uncompressed_buf, |
|||
&uncompressed_bufsize)) |
|||
{ |
|||
fprintf (stderr, |
|||
("inflate large: " |
|||
"benchmark backtrace_uncompress_zdebug failed\n")); |
|||
return; |
|||
} |
|||
|
|||
if (clock_gettime (cid, &ts2) < 0) |
|||
{ |
|||
perror ("clock_gettime"); |
|||
return; |
|||
} |
|||
|
|||
ctime = (ts2.tv_sec - ts1.tv_sec) * 1000000000; |
|||
ctime += ts2.tv_nsec - ts1.tv_nsec; |
|||
ctimes[i] = ctime; |
|||
|
|||
if (clock_gettime (cid, &ts1) < 0) |
|||
{ |
|||
perror("clock_gettime"); |
|||
return; |
|||
} |
|||
|
|||
uncompress_sizearg = uncompressed_bufsize; |
|||
r = uncompress (uncompressed_buf, &uncompress_sizearg, |
|||
compressed_buf + 12, compressed_bufsize - 12); |
|||
|
|||
if (clock_gettime (cid, &ts2) < 0) |
|||
{ |
|||
perror ("clock_gettime"); |
|||
return; |
|||
} |
|||
|
|||
if (r != Z_OK) |
|||
{ |
|||
fprintf (stderr, |
|||
"inflate large: benchmark zlib uncompress failed: %d\n", |
|||
r); |
|||
return; |
|||
} |
|||
|
|||
ztime = (ts2.tv_sec - ts1.tv_sec) * 1000000000; |
|||
ztime += ts2.tv_nsec - ts1.tv_nsec; |
|||
ztimes[i] = ztime; |
|||
} |
|||
|
|||
/* Toss the highest and lowest times and average the rest. */ |
|||
ctime = average_time (ctimes, trials); |
|||
ztime = average_time (ztimes, trials); |
|||
|
|||
printf ("backtrace: %zu ns\n", ctime); |
|||
printf ("zlib : %zu ns\n", ztime); |
|||
printf ("ratio : %g\n", (double) ztime / (double) ctime); |
|||
|
|||
return; |
|||
|
|||
fail: |
|||
printf ("FAIL: inflate large\n"); |
|||
++failures; |
|||
|
|||
if (orig_buf != NULL) |
|||
free (orig_buf); |
|||
if (compressed_buf != NULL) |
|||
free (compressed_buf); |
|||
if (uncompressed_buf != NULL) |
|||
free (uncompressed_buf); |
|||
|
|||
#else /* !HAVE_ZLIB */ |
|||
|
|||
printf ("UNSUPPORTED: inflate large\n"); |
|||
|
|||
#endif /* !HAVE_ZLIB */ |
|||
} |
|||
|
|||
int |
|||
main (int argc ATTRIBUTE_UNUSED, char **argv) |
|||
{ |
|||
struct backtrace_state *state; |
|||
|
|||
state = backtrace_create_state (argv[0], BACKTRACE_SUPPORTS_THREADS, |
|||
error_callback_create, NULL); |
|||
|
|||
test_samples (state); |
|||
test_large (state); |
|||
|
|||
exit (failures != 0 ? EXIT_FAILURE : EXIT_SUCCESS); |
|||
} |
@ -0,0 +1,25 @@ |
|||
*~ |
|||
*.pc |
|||
*.la |
|||
*.o |
|||
libtool |
|||
ltmain.sh |
|||
missing |
|||
install-sh |
|||
depcomp |
|||
configure |
|||
config.* |
|||
*.lo |
|||
autom4te.cache |
|||
ar-lib |
|||
test-driver |
|||
aclocal.m4 |
|||
Makefile |
|||
Makefile.in |
|||
.deps |
|||
*.log |
|||
.libs |
|||
ii |
|||
*.tar* |
|||
base58 |
|||
tests/*.trs |
@ -0,0 +1,2 @@ |
|||
Luke Dashjr <luke-jr+libbase58@utopios.org> |
|||
Huang Le <4tarhl@gmail.com> |
@ -0,0 +1,19 @@ |
|||
Copyright (c) 2014 Luke Dashjr |
|||
|
|||
Permission is hereby granted, free of charge, to any person obtaining a copy |
|||
of this software and associated documentation files (the "Software"), to deal |
|||
in the Software without restriction, including without limitation the rights |
|||
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
|||
copies of the Software, and to permit persons to whom the Software is |
|||
furnished to do so, subject to the following conditions: |
|||
|
|||
The above copyright notice and this permission notice shall be included in |
|||
all copies or substantial portions of the Software. |
|||
|
|||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
|||
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
|||
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
|||
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
|||
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
|||
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
|||
THE SOFTWARE. |
@ -0,0 +1,42 @@ |
|||
# Copyright 2014 Luke Dashjr
|
|||
#
|
|||
# This program is free software; you can redistribute it and/or modify it
|
|||
# under the terms of the standard MIT license. See COPYING for more details.
|
|||
|
|||
lib_LTLIBRARIES = libbase58.la |
|||
libbase58_la_SOURCES = base58.c |
|||
libbase58_la_LDFLAGS = -version-info $(LIBBASE58_SO_VERSION) -no-undefined |
|||
|
|||
libbase58_includedir = $(includedir) |
|||
libbase58_include_HEADERS = libbase58.h |
|||
|
|||
pkgconfigdir = $(libdir)/pkgconfig |
|||
pkgconfig_DATA = libbase58.pc |
|||
|
|||
dist_noinst_SCRIPTS = autogen.sh |
|||
dist_doc_DATA = AUTHORS COPYING README |
|||
|
|||
if USE_TOOL |
|||
bin_PROGRAMS = base58 |
|||
base58_SOURCES = clitool.c |
|||
base58_CFLAGS = $(LIBGCRYPT_CFLAGS) |
|||
base58_LDADD = libbase58.la $(LIBGCRYPT_LIBS) |
|||
|
|||
TESTS = \
|
|||
tests/decode.sh \
|
|||
tests/decode-b58c.sh \
|
|||
tests/decode-b58c-fail.sh \
|
|||
tests/decode-b58c-null.sh \
|
|||
tests/decode-b58c-toolong.sh \
|
|||
tests/decode-b58c-tooshort.sh \
|
|||
tests/decode-small.sh \
|
|||
tests/decode-zero.sh \
|
|||
tests/encode.sh \
|
|||
tests/encode-b58c.sh \
|
|||
tests/encode-fail.sh \
|
|||
tests/encode-small.sh |
|||
SH_LOG_COMPILER = /bin/sh |
|||
AM_TESTS_ENVIRONMENT = PATH='$(srcdir)':"$$PATH"; export PATH; |
|||
TESTS_ENVIRONMENT = $(AM_TESTS_ENVIRONMENT) |
|||
endif |
|||
TEST_EXTENSIONS = .sh |
@ -0,0 +1,56 @@ |
|||
Initialisation |
|||
-------------- |
|||
|
|||
Before you can use libbase58 for base58check, you must provide a SHA256 |
|||
function. The required function signature is: |
|||
bool my_sha256(void *digest, const void *data, size_t datasz) |
|||
Simply assign your function to b58_sha256_impl: |
|||
b58_sha256_impl = my_sha256; |
|||
|
|||
This is only required if base58check is used. Raw base58 does not need SHA256. |
|||
|
|||
|
|||
Decoding Base58 |
|||
--------------- |
|||
|
|||
Simply allocate a buffer to store the binary data in, and set a variable with |
|||
the buffer size, and call the b58tobin function: |
|||
bool b58tobin(void *bin, size_t *binsz, const char *b58, size_t b58sz) |
|||
The "canonical" base58 byte length will be assigned to binsz on success, which |
|||
may be larger than the actual buffer if the input has many leading zeros. |
|||
Regardless of the canonical byte length, the full binary buffer will be used. |
|||
If b58sz is zero, it will be initialised with strlen(b58); note that a true |
|||
zero-length base58 string is not supported here. |
|||
|
|||
|
|||
Validating Base58Check |
|||
---------------------- |
|||
|
|||
After calling b58tobin, you can validate base58check data using the b58check |
|||
function: |
|||
int b58check(const void *bin, size_t binsz, const char *b58, size_t b58sz) |
|||
Call it with the same buffers used for b58tobin. If the return value is |
|||
negative, an error occurred. Otherwise, the return value is the base58check |
|||
"version" byte from the decoded data. |
|||
|
|||
|
|||
Encoding Base58 |
|||
--------------- |
|||
|
|||
Allocate a string to store the base58 content, create a size_t variable with the |
|||
size of that allocation, and call: |
|||
bool b58enc(char *b58, size_t *b58sz, const void *data, size_t binsz) |
|||
Note that you must pass a pointer to the string size variable, not the size |
|||
itself. When b58enc returns, the variable will be modified to contain the actual |
|||
number of bytes used (including the null terminator). If encoding fails for any |
|||
reason, or if the string buffer is not large enough for the result, b58enc will |
|||
return false. Otherwise, it returns true to indicate success. |
|||
|
|||
|
|||
Encoding Base58Check |
|||
-------------------- |
|||
|
|||
Targetting base58check is done similarly to raw base58 encoding, but you must |
|||
also provide a version byte: |
|||
bool b58check_enc(char *b58c, size_t *b58c_sz, uint8_t ver, |
|||
const void *data, size_t datasz) |
@ -0,0 +1,11 @@ |
|||
#!/bin/sh -e |
|||
# Written by Luke Dashjr in 2012 |
|||
# This program is released under the terms of the Creative Commons "CC0 1.0 Universal" license and/or copyright waiver. |
|||
|
|||
if test -z "$srcdir"; then |
|||
srcdir=`dirname "$0"` |
|||
if test -z "$srcdir"; then |
|||
srcdir=. |
|||
fi |
|||
fi |
|||
autoreconf --force --install --verbose "$srcdir" |
@ -0,0 +1,201 @@ |
|||
/*
|
|||
* Copyright 2012-2014 Luke Dashjr |
|||
* |
|||
* This program is free software; you can redistribute it and/or modify it |
|||
* under the terms of the standard MIT license. See COPYING for more details. |
|||
*/ |
|||
|
|||
#ifndef WIN32 |
|||
#include <arpa/inet.h> |
|||
#else |
|||
#include <winsock2.h> |
|||
#endif |
|||
|
|||
#include <stdbool.h> |
|||
#include <stddef.h> |
|||
#include <stdint.h> |
|||
#include <string.h> |
|||
#include <sys/types.h> |
|||
|
|||
#include "libbase58.h" |
|||
|
|||
bool (*b58_sha256_impl)(void *, const void *, size_t) = NULL; |
|||
|
|||
static const int8_t b58digits_map[] = { |
|||
-1,-1,-1,-1,-1,-1,-1,-1, -1,-1,-1,-1,-1,-1,-1,-1, |
|||
-1,-1,-1,-1,-1,-1,-1,-1, -1,-1,-1,-1,-1,-1,-1,-1, |
|||
-1,-1,-1,-1,-1,-1,-1,-1, -1,-1,-1,-1,-1,-1,-1,-1, |
|||
-1, 0, 1, 2, 3, 4, 5, 6, 7, 8,-1,-1,-1,-1,-1,-1, |
|||
-1, 9,10,11,12,13,14,15, 16,-1,17,18,19,20,21,-1, |
|||
22,23,24,25,26,27,28,29, 30,31,32,-1,-1,-1,-1,-1, |
|||
-1,33,34,35,36,37,38,39, 40,41,42,43,-1,44,45,46, |
|||
47,48,49,50,51,52,53,54, 55,56,57,-1,-1,-1,-1,-1, |
|||
}; |
|||
|
|||
bool b58tobin(void *bin, size_t *binszp, const char *b58, size_t b58sz) |
|||
{ |
|||
size_t binsz = *binszp; |
|||
const unsigned char *b58u = (void*)b58; |
|||
unsigned char *binu = bin; |
|||
size_t outisz = (binsz + 3) / 4; |
|||
uint32_t outi[outisz]; |
|||
uint64_t t; |
|||
uint32_t c; |
|||
size_t i, j; |
|||
uint8_t bytesleft = binsz % 4; |
|||
uint32_t zeromask = bytesleft ? (0xffffffff << (bytesleft * 8)) : 0; |
|||
unsigned zerocount = 0; |
|||
|
|||
if (!b58sz) |
|||
b58sz = strlen(b58); |
|||
|
|||
memset(outi, 0, outisz * sizeof(*outi)); |
|||
|
|||
// Leading zeros, just count
|
|||
for (i = 0; i < b58sz && b58u[i] == '1'; ++i) |
|||
++zerocount; |
|||
|
|||
for ( ; i < b58sz; ++i) |
|||
{ |
|||
if (b58u[i] & 0x80) |
|||
// High-bit set on invalid digit
|
|||
return false; |
|||
if (b58digits_map[b58u[i]] == -1) |
|||
// Invalid base58 digit
|
|||
return false; |
|||
c = (unsigned)b58digits_map[b58u[i]]; |
|||
for (j = outisz; j--; ) |
|||
{ |
|||
t = ((uint64_t)outi[j]) * 58 + c; |
|||
c = (t & 0x3f00000000) >> 32; |
|||
outi[j] = t & 0xffffffff; |
|||
} |
|||
if (c) |
|||
// Output number too big (carry to the next int32)
|
|||
return false; |
|||
if (outi[0] & zeromask) |
|||
// Output number too big (last int32 filled too far)
|
|||
return false; |
|||
} |
|||
|
|||
j = 0; |
|||
switch (bytesleft) { |
|||
case 3: |
|||
*(binu++) = (outi[0] & 0xff0000) >> 16; |
|||
case 2: |
|||
*(binu++) = (outi[0] & 0xff00) >> 8; |
|||
case 1: |
|||
*(binu++) = (outi[0] & 0xff); |
|||
++j; |
|||
default: |
|||
break; |
|||
} |
|||
|
|||
for (; j < outisz; ++j) |
|||
{ |
|||
*(binu++) = (outi[j] >> 0x18) & 0xff; |
|||
*(binu++) = (outi[j] >> 0x10) & 0xff; |
|||
*(binu++) = (outi[j] >> 8) & 0xff; |
|||
*(binu++) = (outi[j] >> 0) & 0xff; |
|||
} |
|||
|
|||
// Count canonical base58 byte count
|
|||
binu = bin; |
|||
for (i = 0; i < binsz; ++i) |
|||
{ |
|||
if (binu[i]) |
|||
break; |
|||
--*binszp; |
|||
} |
|||
*binszp += zerocount; |
|||
|
|||
return true; |
|||
} |
|||
|
|||
static |
|||
bool my_dblsha256(void *hash, const void *data, size_t datasz) |
|||
{ |
|||
uint8_t buf[0x20]; |
|||
return b58_sha256_impl(buf, data, datasz) && b58_sha256_impl(hash, buf, sizeof(buf)); |
|||
} |
|||
|
|||
int b58check(const void *bin, size_t binsz, const char *base58str, size_t b58sz) |
|||
{ |
|||
unsigned char buf[32]; |
|||
const uint8_t *binc = bin; |
|||
unsigned i; |
|||
if (binsz < 4) |
|||
return -4; |
|||
if (!my_dblsha256(buf, bin, binsz - 4)) |
|||
return -2; |
|||
if (memcmp(&binc[binsz - 4], buf, 4)) |
|||
return -1; |
|||
|
|||
// Check number of zeros is correct AFTER verifying checksum (to avoid possibility of accessing base58str beyond the end)
|
|||
for (i = 0; binc[i] == '\0' && base58str[i] == '1'; ++i) |
|||
{} // Just finding the end of zeros, nothing to do in loop
|
|||
if (binc[i] == '\0' || base58str[i] == '1') |
|||
return -3; |
|||
|
|||
return binc[0]; |
|||
} |
|||
|
|||
static const char b58digits_ordered[] = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"; |
|||
|
|||
bool b58enc(char *b58, size_t *b58sz, const void *data, size_t binsz) |
|||
{ |
|||
const uint8_t *bin = data; |
|||
int carry; |
|||
ssize_t i, j, high, zcount = 0; |
|||
size_t size; |
|||
|
|||
while (zcount < binsz && !bin[zcount]) |
|||
++zcount; |
|||
|
|||
size = (binsz - zcount) * 138 / 100 + 1; |
|||
uint8_t buf[size]; |
|||
memset(buf, 0, size); |
|||
|
|||
for (i = zcount, high = size - 1; i < binsz; ++i, high = j) |
|||
{ |
|||
for (carry = bin[i], j = size - 1; (j > high) || carry; --j) |
|||
{ |
|||
carry += 256 * buf[j]; |
|||
buf[j] = carry % 58; |
|||
carry /= 58; |
|||
} |
|||
} |
|||
|
|||
for (j = 0; j < size && !buf[j]; ++j); |
|||
|
|||
if (*b58sz <= zcount + size - j) |
|||
{ |
|||
*b58sz = zcount + size - j + 1; |
|||
return false; |
|||
} |
|||
|
|||
if (zcount) |
|||
memset(b58, '1', zcount); |
|||
for (i = zcount; j < size; ++i, ++j) |
|||
b58[i] = b58digits_ordered[buf[j]]; |
|||
b58[i] = '\0'; |
|||
*b58sz = i + 1; |
|||
|
|||
return true; |
|||
} |
|||
|
|||
bool b58check_enc(char *b58c, size_t *b58c_sz, uint8_t ver, const void *data, size_t datasz) |
|||
{ |
|||
uint8_t buf[1 + datasz + 0x20]; |
|||
uint8_t *hash = &buf[1 + datasz]; |
|||
|
|||
buf[0] = ver; |
|||
memcpy(&buf[1], data, datasz); |
|||
if (!my_dblsha256(hash, buf, datasz + 1)) |
|||
{ |
|||
*b58c_sz = 0; |
|||
return false; |
|||
} |
|||
|
|||
return b58enc(b58c, b58c_sz, buf, 1 + datasz + 4); |
|||
} |
@ -0,0 +1,130 @@ |
|||
/*
|
|||
* Copyright 2014 Luke Dashjr |
|||
* |
|||
* This program is free software; you can redistribute it and/or modify it |
|||
* under the terms of the standard MIT license. See COPYING for more details. |
|||
*/ |
|||
|
|||
#include <ctype.h> |
|||
#include <stdbool.h> |
|||
#include <stdint.h> |
|||
#include <stdio.h> |
|||
#include <stdlib.h> |
|||
#include <string.h> |
|||
#include <unistd.h> |
|||
|
|||
#include <gcrypt.h> |
|||
|
|||
#include "libbase58.h" |
|||
|
|||
static |
|||
bool my_sha256(void *digest, const void *data, size_t datasz) |
|||
{ |
|||
gcry_md_hash_buffer(GCRY_MD_SHA256, digest, data, datasz); |
|||
return true; |
|||
} |
|||
|
|||
static |
|||
void usage(const char *prog) |
|||
{ |
|||
fprintf(stderr, "Usage: %s [-c] [-d] [data]\n", prog); |
|||
fprintf(stderr, "\t-c Use base58check (default: raw base58)\n"); |
|||
fprintf(stderr, "\t-d <size> Decode <size> bytes\n"); |
|||
exit(1); |
|||
} |
|||
|
|||
int main(int argc, char **argv) |
|||
{ |
|||
bool b58c = false; |
|||
size_t decode = 0; |
|||
int opt; |
|||
while ( (opt = getopt(argc, argv, "cd:h")) != -1) |
|||
{ |
|||
switch (opt) |
|||
{ |
|||
case 'c': |
|||
b58c = true; |
|||
b58_sha256_impl = my_sha256; |
|||
break; |
|||
case 'd': |
|||
{ |
|||
int i = atoi(optarg); |
|||
if (i < 0 || (uintmax_t)i >= SIZE_MAX) |
|||
usage(argv[0]); |
|||
decode = (size_t)i; |
|||
break; |
|||
} |
|||
default: |
|||
usage(argv[0]); |
|||
} |
|||
} |
|||
|
|||
size_t rt; |
|||
union { |
|||
uint8_t *b; |
|||
char *s; |
|||
} r; |
|||
if (optind >= argc) |
|||
{ |
|||
rt = 0; |
|||
r.b = NULL; |
|||
while (!feof(stdin)) |
|||
{ |
|||
r.b = realloc(r.b, rt + 0x100); |
|||
rt += fread(&r.b[rt], 1, 0x100, stdin); |
|||
} |
|||
if (decode) |
|||
while (isspace(r.s[rt-1])) |
|||
--rt; |
|||
} |
|||
else |
|||
{ |
|||
r.s = argv[optind]; |
|||
rt = strlen(argv[optind]); |
|||
} |
|||
|
|||
if (decode) |
|||
{ |
|||
uint8_t bin[decode]; |
|||
size_t ssz = decode; |
|||
if (!b58tobin(bin, &ssz, r.s, rt)) |
|||
return 2; |
|||
if (b58c) |
|||
{ |
|||
int chk = b58check(bin, decode, r.s, rt); |
|||
if (chk < 0) |
|||
return chk; |
|||
if (fwrite(bin, decode, 1, stdout) != 1) |
|||
return 3; |
|||
} |
|||
else |
|||
{ |
|||
// Raw base58 doesn't check length match
|
|||
uint8_t cbin[ssz]; |
|||
if (ssz > decode) |
|||
{ |
|||
size_t zeros = ssz - decode; |
|||
memset(cbin, 0, zeros); |
|||
memcpy(&cbin[zeros], bin, decode); |
|||
} |
|||
else |
|||
memcpy(cbin, &bin[decode - ssz], ssz); |
|||
|
|||
if (fwrite(cbin, ssz, 1, stdout) != 1) |
|||
return 3; |
|||
} |
|||
} |
|||
else |
|||
{ |
|||
size_t ssz = rt * 2; |
|||
char s[ssz]; |
|||
bool rv; |
|||
if (b58c) |
|||
rv = rt && b58check_enc(s, &ssz, r.b[0], &r.b[1], rt-1); |
|||
else |
|||
rv = b58enc(s, &ssz, r.b, rt); |
|||
if (!rv) |
|||
return 2; |
|||
puts(s); |
|||
} |
|||
} |
@ -0,0 +1,49 @@ |
|||
dnl * Copyright 2012-2014 Luke Dashjr |
|||
dnl * |
|||
dnl * This program is free software; you can redistribute it and/or modify it |
|||
dnl * under the terms of the standard MIT license. See COPYING for more details. |
|||
|
|||
AC_INIT( |
|||
[libbase58], |
|||
[0.1.4], |
|||
[luke_libbase58@dashjr.org], |
|||
[libbase58]) |
|||
AC_CONFIG_AUX_DIR([.]) |
|||
AC_PREREQ([2.59]) |
|||
AM_INIT_AUTOMAKE([1.11 -Wall dist-xz foreign]) |
|||
m4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES([yes])]) |
|||
|
|||
AC_PROG_CC_C99 |
|||
m4_ifdef([AM_PROG_AR], [AM_PROG_AR]) |
|||
LT_INIT([]) |
|||
|
|||
# http://www.gnu.org/software/libtool/manual/html_node/Updating-version-info.html |
|||
AC_SUBST([LIBBASE58_SO_VERSION], [0:2:0]) |
|||
|
|||
AC_CONFIG_FILES([Makefile |
|||
libbase58.pc:libbase58.pc.in |
|||
]) |
|||
|
|||
AC_CHECK_LIB([ws2_32], [strchr]) |
|||
|
|||
m4_ifdef([AM_PATH_LIBGCRYPT], [ |
|||
AC_ARG_ENABLE([tool], |
|||
[AC_HELP_STRING([--disable-tool],[Compile command line base58 tool (default enabled)])], |
|||
[use_tool=$enableval], |
|||
[use_tool=auto]) |
|||
if test x$use_tool != xno; then |
|||
AM_PATH_LIBGCRYPT([],[ |
|||
use_tool=yes |
|||
],[ |
|||
if test x$use_tool = xyes; then |
|||
AC_MSG_ERROR([libgcrypt not found; use --disable-tool]) |
|||
fi |
|||
use_tool=no |
|||
]) |
|||
fi |
|||
],[ |
|||
m4_warn([syntax], [AM_PATH_LIBGCRYPT missing; CLI tool will not be available]) |
|||
]) |
|||
AM_CONDITIONAL([USE_TOOL], [test x$use_tool = xyes]) |
|||
|
|||
AC_OUTPUT |
@ -0,0 +1,23 @@ |
|||
#ifndef LIBBASE58_H |
|||
#define LIBBASE58_H |
|||
|
|||
#include <stdbool.h> |
|||
#include <stddef.h> |
|||
|
|||
#ifdef __cplusplus |
|||
extern "C" { |
|||
#endif |
|||
|
|||
extern bool (*b58_sha256_impl)(void *, const void *, size_t); |
|||
|
|||
extern bool b58tobin(void *bin, size_t *binsz, const char *b58, size_t b58sz); |
|||
extern int b58check(const void *bin, size_t binsz, const char *b58, size_t b58sz); |
|||
|
|||
extern bool b58enc(char *b58, size_t *b58sz, const void *bin, size_t binsz); |
|||
extern bool b58check_enc(char *b58c, size_t *b58c_sz, uint8_t ver, const void *data, size_t datasz); |
|||
|
|||
#ifdef __cplusplus |
|||
} |
|||
#endif |
|||
|
|||
#endif |
@ -0,0 +1,10 @@ |
|||
prefix=@prefix@ |
|||
exec_prefix=@exec_prefix@ |
|||
libdir=@libdir@ |
|||
includedir=@includedir@ |
|||
|
|||
Name: @PACKAGE_NAME@ |
|||
Description: Library for Bitcoin's base58 encoding. |
|||
Version: @PACKAGE_VERSION@ |
|||
Libs: -L${libdir} -lbase58 |
|||
Cflags: -I${includedir} |
@ -0,0 +1,2 @@ |
|||
#!/bin/sh |
|||
! base58 -d 25 -c 19DXstMaV43WpYg4ceREiiTv2UntmoiA9a >/dev/null |
@ -0,0 +1,3 @@ |
|||
#!/bin/sh |
|||
hex=$(base58 -d 25 -c 19DXstMaV43WpYg4ceREiiTv2UntmoiA9a | xxd -p) |
|||
test x$hex = x |
@ -0,0 +1,2 @@ |
|||
#!/bin/sh |
|||
! base58 -d 25 -c 1119DXstMaV43WpYg4ceREiiTv2UntmoiA9a >/dev/null |
@ -0,0 +1,2 @@ |
|||
#!/bin/sh |
|||
! base58 -d 25 -c 111111111111111111114oLvT2 >/dev/null |
@ -0,0 +1,3 @@ |
|||
#!/bin/sh |
|||
hex=$(base58 -d 25 -c 19DXstMaV43WpYg4ceREiiTv2UntmoiA9j | xxd -p) |
|||
test x$hex != x005a1fc5dd9e6f03819fca94a2d89669469667f9a1 |
@ -0,0 +1,3 @@ |
|||
#!/bin/sh |
|||
hex=$(echo 993233 | xxd -r -p | base58 -d 25 || echo FAIL) |
|||
test "x${hex}" = "xFAIL" |
@ -0,0 +1,3 @@ |
|||
#!/bin/sh |
|||
hex=$(echo 319932 | xxd -r -p | base58 -d 25 || echo FAIL) |
|||
test "x${hex}" = "xFAIL" |
@ -0,0 +1,3 @@ |
|||
#!/bin/sh |
|||
hex=$(base58 -d 4 2 | xxd -p) |
|||
test x$hex = x01 |
@ -0,0 +1,3 @@ |
|||
#!/bin/sh |
|||
hex=$(base58 -d 25 111111 | xxd -p) |
|||
test x$hex = x000000000000 |
@ -0,0 +1,3 @@ |
|||
#!/bin/sh |
|||
hex=$(base58 -d 50 19DXstMaV43WpYg4ceREiiTv2UntmoiA9j | xxd -p) |
|||
test x$hex = x005a1fc5dd9e6f03819fca94a2d89669469667f9a074655946 |
@ -0,0 +1,3 @@ |
|||
#!/bin/sh |
|||
b58=$(echo '005a1fc5dd9e6f03819fca94a2d89669469667f9a0' | xxd -r -p | base58 -c) |
|||
test x$b58 = x19DXstMaV43WpYg4ceREiiTv2UntmoiA9j |
@ -0,0 +1,3 @@ |
|||
#!/bin/sh |
|||
b58=$(echo '005a1fc5dd9e6f03819fca94a2d89669469667f9a174655946' | xxd -r -p | base58) |
|||
test x$b58 != x19DXstMaV43WpYg4ceREiiTv2UntmoiA9j |
@ -0,0 +1,3 @@ |
|||
#!/bin/sh |
|||
b58=$(base58 1) |
|||
test x$b58 = xr |
@ -0,0 +1,3 @@ |
|||
#!/bin/sh |
|||
b58=$(echo '005a1fc5dd9e6f03819fca94a2d89669469667f9a074655946' | xxd -r -p | base58) |
|||
test x$b58 = x19DXstMaV43WpYg4ceREiiTv2UntmoiA9j |
@ -0,0 +1,157 @@ |
|||
*.bc |
|||
*.cmake |
|||
*.dSYM |
|||
*.done |
|||
*.final |
|||
*.gcda |
|||
*.gcno |
|||
*.i |
|||
*.la |
|||
*.lo |
|||
*.log |
|||
*.mem |
|||
*.nexe |
|||
*.o |
|||
*.plist |
|||
*.scan |
|||
*.sdf |
|||
*.status |
|||
*.tar.* |
|||
*.wasm |
|||
*.wast |
|||
*~ |
|||
.DS_Store |
|||
.deps |
|||
.dirstamp |
|||
.done |
|||
.libs |
|||
/bin/ |
|||
/obj/ |
|||
Build |
|||
INSTALL |
|||
Makefile |
|||
Makefile.in |
|||
Vagrantfile |
|||
aclocal.m4 |
|||
android-toolchain |
|||
android-toolchain-* |
|||
autom4te.cache |
|||
build |
|||
compile |
|||
confdefs.h |
|||
config.* |
|||
configure |
|||
configure.lineno |
|||
coverage.info |
|||
depcomp |
|||
install-sh |
|||
libsodium-*.tar.bz2 |
|||
libsodium-*.tar.gz |
|||
libsodium-*.vcproj |
|||
libsodium-*.vcproj.filters |
|||
libsodium-*.vcxproj |
|||
libsodium-*.vcxproj.filters |
|||
libsodium-android-* |
|||
libsodium-ios |
|||
libsodium-js |
|||
libsodium-js-* |
|||
libsodium-nativeclient |
|||
libsodium-nativeclient-* |
|||
libsodium-osx |
|||
libsodium-uninstalled.pc |
|||
libsodium-win32 |
|||
libsodium-win64 |
|||
libsodium.pc |
|||
libtool |
|||
ltmain.sh |
|||
m4/argz.m4 |
|||
m4/libtool.m4 |
|||
m4/ltoptions.m4 |
|||
m4/ltsugar.m4 |
|||
m4/ltversion.m4 |
|||
m4/lt~obsolete.m4 |
|||
man/*.html |
|||
man/Makefile.in |
|||
missing |
|||
src/libsodium/*.def |
|||
src/libsodium/include/sodium/version.h |
|||
stamp-* |
|||
test-driver |
|||
test/default/browser |
|||
test/default/*.asm.js |
|||
test/default/*.res |
|||
test/default/*.trs |
|||
test/default/aead_aes256gcm |
|||
test/default/aead_chacha20poly1305 |
|||
test/default/aead_xchacha20poly1305 |
|||
test/default/auth |
|||
test/default/auth2 |
|||
test/default/auth3 |
|||
test/default/auth5 |
|||
test/default/auth6 |
|||
test/default/auth7 |
|||
test/default/box |
|||
test/default/box2 |
|||
test/default/box7 |
|||
test/default/box8 |
|||
test/default/box_easy |
|||
test/default/box_easy2 |
|||
test/default/box_seal |
|||
test/default/box_seed |
|||
test/default/chacha20 |
|||
test/default/codecs |
|||
test/default/core_ed25519 |
|||
test/default/core1 |
|||
test/default/core2 |
|||
test/default/core3 |
|||
test/default/core4 |
|||
test/default/core5 |
|||
test/default/core6 |
|||
test/default/ed25519_convert |
|||
test/default/generichash |
|||
test/default/generichash2 |
|||
test/default/generichash3 |
|||
test/default/hash |
|||
test/default/hash3 |
|||
test/default/kdf |
|||
test/default/keygen |
|||
test/default/kx |
|||
test/default/metamorphic |
|||
test/default/misuse |
|||
test/default/onetimeauth |
|||
test/default/onetimeauth2 |
|||
test/default/onetimeauth7 |
|||
test/default/pwhash_argon2i |
|||
test/default/pwhash_argon2id |
|||
test/default/pwhash_scrypt |
|||
test/default/pwhash_scrypt_ll |
|||
test/default/randombytes |
|||
test/default/scalarmult |
|||
test/default/scalarmult_ed25519 |
|||
test/default/scalarmult2 |
|||
test/default/scalarmult5 |
|||
test/default/scalarmult6 |
|||
test/default/scalarmult7 |
|||
test/default/secretbox |
|||
test/default/secretbox2 |
|||
test/default/secretbox7 |
|||
test/default/secretbox8 |
|||
test/default/secretbox_easy |
|||
test/default/secretbox_easy2 |
|||
test/default/secretstream |
|||
test/default/shorthash |
|||
test/default/sign |
|||
test/default/siphashx24 |
|||
test/default/sodium_core |
|||
test/default/sodium_utils |
|||
test/default/sodium_utils2 |
|||
test/default/sodium_utils3 |
|||
test/default/sodium_version |
|||
test/default/stream |
|||
test/default/stream2 |
|||
test/default/stream3 |
|||
test/default/stream4 |
|||
test/default/verify1 |
|||
test/default/xchacha20 |
|||
test/js.done |
|||
testing |
@ -0,0 +1,33 @@ |
|||
sudo: false |
|||
|
|||
language: c |
|||
|
|||
os: |
|||
- linux |
|||
|
|||
compiler: |
|||
- clang |
|||
- gcc |
|||
- g++ |
|||
|
|||
install: |
|||
- ./autogen.sh |
|||
- env CC=tcc CFLAGS='-w' ./configure --prefix=/tmp --disable-dependency-tracking --disable-shared || cat config.log |
|||
- make -j $(nproc) && make check && make install |
|||
- env CC=tcc CPPFLAGS='-I/tmp/include' LDFLAGS='-L/tmp/lib' LD_LIBRARY_PATH='/tmp/lib' ./test/constcheck.sh |
|||
- make uninstall |
|||
- make distclean |
|||
|
|||
script: |
|||
- ./configure --disable-dependency-tracking |
|||
- if [ "$TRAVIS_OS_NAME" = 'linux' -a "$CC" = 'gcc' ]; then make -j $(nproc) CFLAGS='-g0' > /dev/null && cp src/libsodium/.libs/libsodium.so lib.so && make clean > /dev/null && make CFLAGS='-g0' CPPFLAGS='-DSODIUM_C99\(X\)=' > /dev/null && cp src/libsodium/.libs/libsodium.so lib-oldc.so && cmp lib.so lib-oldc.so && echo No binary changes && make clean > /dev/null ; fi |
|||
- make distcheck |
|||
- make distclean > /dev/null |
|||
- ./configure --disable-dependency-tracking --enable-minimal |
|||
- make check |
|||
- ( echo '#include <sodium.h>' ; echo 'int main(void) { return sodium_init(); }' ) > /tmp/main.c && gcc -Isrc/libsodium/include -Isrc/libsodium/include/sodium $(find src -name '*.c' -o -name '*.S') /tmp/main.c |
|||
|
|||
addons: |
|||
apt: |
|||
packages: |
|||
- tcc |
@ -0,0 +1,135 @@ |
|||
|
|||
Designers |
|||
========= |
|||
|
|||
argon2 Alex Biryukov |
|||
Daniel Dinu |
|||
Dmitry Khovratovich |
|||
|
|||
blake2 Jean-Philippe Aumasson |
|||
Christian Winnerlein |
|||
Samuel Neves |
|||
Zooko Wilcox-O'Hearn |
|||
|
|||
chacha20 Daniel J. Bernstein |
|||
|
|||
chacha20poly1305 Adam Langley |
|||
Yoav Nir |
|||
|
|||
curve25519 Daniel J. Bernstein |
|||
|
|||
curve25519xsalsa20poly1305 Daniel J. Bernstein |
|||
|
|||
ed25519 Daniel J. Bernstein |
|||
Bo-Yin Yang |
|||
Niels Duif |
|||
Peter Schwabe |
|||
Tanja Lange |
|||
|
|||
poly1305 Daniel J. Bernstein |
|||
|
|||
salsa20 Daniel J. Bernstein |
|||
|
|||
scrypt Colin Percival |
|||
|
|||
siphash Jean-Philippe Aumasson |
|||
Daniel J. Bernstein |
|||
|
|||
Implementors |
|||
============ |
|||
|
|||
crypto_aead/aes256gcm/aesni Romain Dolbeau |
|||
Frank Denis |
|||
|
|||
crypto_aead/chacha20poly1305 Frank Denis |
|||
|
|||
crypto_aead/xchacha20poly1305 Frank Denis |
|||
Jason A. Donenfeld |
|||
|
|||
crypto_auth/hmacsha256 Colin Percival |
|||
crypto_auth/hmacsha512 |
|||
crypto_auth/hmacsha512256 |
|||
|
|||
crypto_box/curve25519xsalsa20poly1305 Daniel J. Bernstein |
|||
|
|||
crypto_box/curve25519xchacha20poly1305 Frank Denis |
|||
|
|||
crypto_core/ed25519 Daniel J. Bernstein |
|||
Adam Langley |
|||
|
|||
crypto_core/hchacha20 Frank Denis |
|||
|
|||
crypto_core/hsalsa20 Daniel J. Bernstein |
|||
crypto_core/salsa |
|||
|
|||
crypto_generichash/blake2b Jean-Philippe Aumasson |
|||
Christian Winnerlein |
|||
Samuel Neves |
|||
Zooko Wilcox-O'Hearn |
|||
|
|||
crypto_hash/sha256 Colin Percival |
|||
crypto_hash/sha512 |
|||
crypto_hash/sha512256 |
|||
|
|||
crypto_kdf Frank Denis |
|||
|
|||
crypto_kx Frank Denis |
|||
|
|||
crypto_onetimeauth/poly1305/donna Andrew "floodyberry" Moon |
|||
crypto_onetimeauth/poly1305/sse2 |
|||
|
|||
crypto_pwhash/argon2 Samuel Neves |
|||
Dmitry Khovratovich |
|||
Jean-Philippe Aumasson |
|||
Daniel Dinu |
|||
Thomas Pornin |
|||
|
|||
crypto_pwhash/scryptsalsa208sha256 Colin Percival |
|||
Alexander Peslyak |
|||
|
|||
crypto_scalarmult/curve25519/ref10 Daniel J. Bernstein |
|||
|
|||
crypto_scalarmult/curve25519/sandy2x Tung Chou |
|||
|
|||
crypto_scalarmult/ed25519 Frank Denis |
|||
|
|||
crypto_secretbox/xsalsa20poly1305 Daniel J. Bernstein |
|||
|
|||
crypto_secretbox/xchacha20poly1305 Frank Denis |
|||
|
|||
crypto_secretstream/xchacha20poly1305 Frank Denis |
|||
|
|||
crypto_shorthash/siphash24 Jean-Philippe Aumasson |
|||
Daniel J. Bernstein |
|||
|
|||
crypto_sign/ed25519 Peter Schwabe |
|||
Daniel J. Bernstein |
|||
Niels Duif |
|||
Tanja Lange |
|||
Bo-Yin Yang |
|||
|
|||
crypto_stream/chacha20/ref Daniel J. Bernstein |
|||
|
|||
crypto_stream/chacha20/dolbeau Romain Dolbeau |
|||
Daniel J. Bernstein |
|||
|
|||
crypto_stream/salsa20/ref Daniel J. Bernstein |
|||
crypto_stream/salsa20/xmm6 |
|||
|
|||
crypto_stream/salsa20/xmm6int Romain Dolbeau |
|||
Daniel J. Bernstein |
|||
|
|||
crypto_stream/salsa2012/ref Daniel J. Bernstein |
|||
crypto_stream/salsa2008/ref |
|||
|
|||
crypto_stream/xchacha20 Frank Denis |
|||
|
|||
crypto_verify Frank Denis |
|||
|
|||
sodium/codecs.c Frank Denis |
|||
Thomas Pornin |
|||
Christian Winnerlein |
|||
|
|||
sodium/core.c Frank Denis |
|||
sodium/runtime.h |
|||
sodium/utils.c |
@ -0,0 +1,505 @@ |
|||
|
|||
* Version 1.0.16 |
|||
- Signatures computations and verifications are now way faster on |
|||
64-bit platforms with compilers supporting 128-bit arithmetic (gcc, |
|||
clang, icc). This includes the WebAssembly target. |
|||
- New low-level APIs for computations over edwards25519: |
|||
`crypto_scalarmult_ed25519()`, `crypto_scalarmult_ed25519_base()`, |
|||
`crypto_core_ed25519_is_valid_point()`, `crypto_core_ed25519_add()`, |
|||
`crypto_core_ed25519_sub()` and `crypto_core_ed25519_from_uniform()` |
|||
(elligator representative to point). |
|||
- `crypto_sign_open()`, `crypto_sign_verify_detached() and |
|||
`crypto_sign_edwards25519sha512batch_open` now reject public keys in |
|||
non-canonical form in addition to low-order points. |
|||
- The library can be built with `ED25519_NONDETERMINISTIC` defined in |
|||
order to use synthetic nonces for EdDSA. This is disabled by default. |
|||
- Webassembly: `crypto_pwhash_*()` functions are now included in |
|||
non-sumo builds. |
|||
- `sodium_stackzero()` was added to wipe content off the stack. |
|||
- Android: support new SDKs where unified headers have become the |
|||
default. |
|||
- The Salsa20-based PRNG example is now thread-safe on platforms with |
|||
support for thread-local storage, optionally mixes bits from RDRAND. |
|||
- CMAKE: static library detection on Unix systems has been improved |
|||
(thanks to @BurningEnlightenment, @nibua-r, @mellery451) |
|||
- Argon2 and scrypt are slightly faster on Linux. |
|||
|
|||
* Version 1.0.15 |
|||
- The default password hashing algorithm is now Argon2id. The |
|||
`pwhash_str_verify()` function can still verify Argon2i hashes |
|||
without any changes, and `pwhash()` can still compute Argon2i hashes |
|||
as well. |
|||
- The aes128ctr primitive was removed. It was slow, non-standard, not |
|||
authenticated, and didn't seem to be used by any opensource project. |
|||
- Argon2id required at least 3 passes like Argon2i, despite a minimum |
|||
of `1` as defined by the `OPSLIMIT_MIN` constant. This has been fixed. |
|||
- The secretstream construction was slightly changed to be consistent |
|||
with forthcoming variants. |
|||
- The Javascript and Webassembly versions have been merged, and the |
|||
module now returns a `.ready` promise that will resolve after the |
|||
Webassembly code is loaded and compiled. |
|||
- Note that due to these incompatible changes, the library version |
|||
major was bumped up. |
|||
|
|||
* Version 1.0.14 |
|||
- iOS binaries should now be compatible with WatchOS and TVOS. |
|||
- WebAssembly is now officially supported. Special thanks to |
|||
@facekapow and @pepyakin who helped to make it happen. |
|||
- Internal consistency checks failing and primitives used with |
|||
dangerous/out-of-bounds/invalid parameters used to call abort(3). |
|||
Now, a custom handler *that doesn't return* can be set with the |
|||
`set_sodium_misuse()` function. It still aborts by default or if the |
|||
handler ever returns. This is not a replacement for non-fatal, |
|||
expected runtime errors. This handler will be only called in |
|||
unexpected situations due to potential bugs in the library or in |
|||
language bindings. |
|||
- `*_MESSAGEBYTES_MAX` macros (and the corresponding |
|||
`_messagebytes_max()` symbols) have been added to represent the |
|||
maximum message size that can be safely handled by a primitive. |
|||
Language bindings are encouraged to check user inputs against these |
|||
maximum lengths. |
|||
- The test suite has been extended to cover more edge cases. |
|||
- crypto_sign_ed25519_pk_to_curve25519() now rejects points that are |
|||
not on the curve, or not in the main subgroup. |
|||
- Further changes have been made to ensure that smart compilers will |
|||
not optimize out code that we don't want to be optimized. |
|||
- Visual Studio solutions are now included in distribution tarballs. |
|||
- The `sodium_runtime_has_*` symbols for CPU features detection are |
|||
now defined as weak symbols, i.e. they can be replaced with an |
|||
application-defined implementation. This can be useful to disable |
|||
AVX* when temperature/power consumption is a concern. |
|||
- `crypto_kx_*()` now aborts if called with no non-NULL pointers to |
|||
store keys to. |
|||
- SSE2 implementations of `crypto_verify_*()` have been added. |
|||
- Passwords can be hashed using a specific algorithm with the new |
|||
`crypto_pwhash_str_alg()` function. |
|||
- Due to popular demand, base64 encoding (`sodium_bin2base64()`) and |
|||
decoding (`sodium_base642bin()`) have been implemented. |
|||
- A new `crypto_secretstream_*()` API was added to safely encrypt files |
|||
and multi-part messages. |
|||
- The `sodium_pad()` and `sodium_unpad()` helper functions have been |
|||
added in order to add & remove padding. |
|||
- An AVX512 optimized implementation of Argon2 has been added (written |
|||
by Ondrej Mosnáček, thanks!) |
|||
- The `crypto_pwhash_str_needs_rehash()` function was added to check if |
|||
a password hash string matches the given parameters, or if it needs an |
|||
update. |
|||
- The library can now be compiled with recent versions of |
|||
emscripten/binaryen that don't allow multiple variables declarations |
|||
using a single `var` statement. |
|||
|
|||
* Version 1.0.13 |
|||
- Javascript: the sumo builds now include all symbols. They were |
|||
previously limited to symbols defined in minimal builds. |
|||
- The public `crypto_pwhash_argon2i_MEMLIMIT_MAX` constant was |
|||
incorrectly defined on 32-bit platforms. This has been fixed. |
|||
- Version 1.0.12 didn't compile on OpenBSD/i386 using the base gcc |
|||
compiler. This has been fixed. |
|||
- The Android compilation scripts have been updated for NDK r14b. |
|||
- armv7s-optimized code was re-added to iOS builds. |
|||
- An AVX2 optimized implementation of the Argon2 round function was |
|||
added. |
|||
- The Argon2id variant of Argon2 has been implemented. The |
|||
high-level `crypto_pwhash_str_verify()` function automatically detects |
|||
the algorithm and can verify both Argon2i and Argon2id hashed passwords. |
|||
The default algorithm for newly hashed passwords remains Argon2i in |
|||
this version to avoid breaking compatibility with verifiers running |
|||
libsodium <= 1.0.12. |
|||
- A `crypto_box_curve25519xchacha20poly1305_seal*()` function set was |
|||
implemented. |
|||
- scrypt was removed from minimal builds. |
|||
- libsodium is now available on NuGet. |
|||
|
|||
* Version 1.0.12 |
|||
- Ed25519ph was implemented, adding a multi-part signature API |
|||
(`crypto_sign_init()`, `crypto_sign_update()`, `crypto_sign_final_*()`). |
|||
- New constants and related accessors have been added for Scrypt and |
|||
Argon2. |
|||
- XChaCha20 has been implemented. Like XSalsa20, this construction |
|||
extends the ChaCha20 cipher to accept a 192-bit nonce. This makes it safe |
|||
to use ChaCha20 with random nonces. |
|||
- `crypto_secretbox`, `crypto_box` and `crypto_aead` now offer |
|||
variants leveraging XChaCha20. |
|||
- SHA-2 is about 20% faster, which also gives a speed boost to |
|||
signature and signature verification. |
|||
- AVX2 implementations of Salsa20 and ChaCha20 have been added. They |
|||
are twice as fast as the SSE2 implementations. The speed gain is |
|||
even more significant on Windows, that previously didn't use |
|||
vectorized implementations. |
|||
- New high-level API: `crypto_kdf`, to easily derive one or more |
|||
subkeys from a master key. |
|||
- Siphash with a 128-bit output has been implemented, and is |
|||
available as `crypto_shorthash_siphashx_*`. |
|||
- New `*_keygen()` helpers functions have been added to create secret |
|||
keys for all constructions. This improves code clarity and can prevent keys |
|||
from being partially initialized. |
|||
- A new `randombytes_buf_deterministic()` function was added to |
|||
deterministically fill a memory region with pseudorandom data. This |
|||
function can especially be useful to write reproducible tests. |
|||
- A preliminary `crypto_kx_*()` API was added to compute shared session |
|||
keys. |
|||
- AVX2 detection is more reliable. |
|||
- The pthreads library is not required any more when using MingW. |
|||
- `contrib/Findsodium.cmake` was added as an example to include |
|||
libsodium in a project using cmake. |
|||
- Compatibility with gcc 2.x has been restored. |
|||
- Minimal builds can be checked using `sodium_library_minimal()`. |
|||
- The `--enable-opt` compilation switch has become compatible with more |
|||
platforms. |
|||
- Android builds are now using clang on platforms where it is |
|||
available. |
|||
|
|||
* Version 1.0.11 |
|||
- `sodium_init()` is now thread-safe, and can be safely called multiple |
|||
times. |
|||
- Android binaries now properly support 64-bit Android, targeting |
|||
platform 24, but without breaking compatibility with platforms 16 and |
|||
21. |
|||
- Better support for old gcc versions. |
|||
- On FreeBSD, core dumps are disabled on regions allocated with |
|||
sodium allocation functions. |
|||
- AVX2 detection was fixed, resulting in faster Blake2b hashing on |
|||
platforms where it was not properly detected. |
|||
- The Sandy2x Curve25519 implementation was not as fast as expected |
|||
on some platforms. This has been fixed. |
|||
- The NativeClient target was improved. Most notably, it now supports |
|||
optimized implementations, and uses pepper_49 by default. |
|||
- The library can be compiled with recent Emscripten versions. |
|||
Changes have been made to produce smaller code, and the default heap |
|||
size was reduced in the standard version. |
|||
- The code can now be compiled on SLES11 service pack 4. |
|||
- Decryption functions can now accept a NULL pointer for the output. |
|||
This checks the MAC without writing the decrypted message. |
|||
- crypto_generichash_final() now returns -1 if called twice. |
|||
- Support for Visual Studio 2008 was improved. |
|||
|
|||
* Version 1.0.10 |
|||
- This release only fixes a compilation issue reported with some older |
|||
gcc versions. There are no functional changes over the previous release. |
|||
|
|||
* Version 1.0.9 |
|||
- The Javascript target now includes a `--sumo` option to include all |
|||
the symbols of the original C library. |
|||
- A detached API was added to the ChaCha20-Poly1305 and AES256-GCM |
|||
implementations. |
|||
- The Argon2i password hashing function was added, and is accessible |
|||
directly and through a new, high-level `crypto_pwhash` API. The scrypt |
|||
function remains available as well. |
|||
- A speed-record AVX2 implementation of BLAKE2b was added (thanks to |
|||
Samuel Neves). |
|||
- The library can now be compiled using C++Builder (thanks to @jcolli44) |
|||
- Countermeasures for Ed25519 signatures malleability have been added |
|||
to match the irtf-cfrg-eddsa draft (note that malleability is irrelevant to |
|||
the standard definition of signature security). Signatures with a small-order |
|||
`R` point are now also rejected. |
|||
- Some implementations are now slightly faster when using the Clang |
|||
compiler. |
|||
- The HChaCha20 core function was implemented (`crypto_core_hchacha20()`). |
|||
- No-op stubs were added for all AES256-GCM public functions even when |
|||
compiled on non-Intel platforms. |
|||
- `crypt_generichash_blake2b_statebytes()` was added. |
|||
- New macros were added for the IETF variant of the ChaCha20-Poly1305 |
|||
construction. |
|||
- The library can now be compiled on Minix. |
|||
- HEASLR is now enabled on MinGW builds. |
|||
|
|||
* Version 1.0.8 |
|||
- Handle the case where the CPU supports AVX, but we are running |
|||
on an hypervisor with AVX disabled/not supported. |
|||
- Faster (2x) scalarmult_base() when using the ref10 implementation. |
|||
|
|||
* Version 1.0.7 |
|||
- More functions whose return value should be checked have been |
|||
tagged with `__attribute__ ((warn_unused_result))`: `crypto_box_easy()`, |
|||
`crypto_box_detached()`, `crypto_box_beforenm()`, `crypto_box()`, and |
|||
`crypto_scalarmult()`. |
|||
- Sandy2x, the fastest Curve25519 implementation ever, has been |
|||
merged in, and is automatically used on CPUs supporting the AVX |
|||
instructions set. |
|||
- An SSE2 optimized implementation of Poly1305 was added, and is |
|||
twice as fast as the portable one. |
|||
- An SSSE3 optimized implementation of ChaCha20 was added, and is |
|||
twice as fast as the portable one. |
|||
- Faster `sodium_increment()` for common nonce sizes. |
|||
- New helper functions have been added: `sodium_is_zero()` and |
|||
`sodium_add()`. |
|||
- `sodium_runtime_has_aesni()` now properly detects the CPU flag when |
|||
compiled using Visual Studio. |
|||
|
|||
* Version 1.0.6 |
|||
- Optimized implementations of Blake2 have been added for modern |
|||
Intel platforms. `crypto_generichash()` is now faster than MD5 and SHA1 |
|||
implementations while being far more secure. |
|||
- Functions for which the return value should be checked have been |
|||
tagged with `__attribute__ ((warn_unused_result))`. This will |
|||
intentionally break code compiled with `-Werror` that didn't bother |
|||
checking critical return values. |
|||
- The `crypto_sign_edwards25519sha512batch_*()` functions have been |
|||
tagged as deprecated. |
|||
- Undocumented symbols that were exported, but were only useful for |
|||
internal purposes have been removed or made private: |
|||
`sodium_runtime_get_cpu_features()`, the implementation-specific |
|||
`crypto_onetimeauth_poly1305_donna()` symbols, |
|||
`crypto_onetimeauth_poly1305_set_implementation()`, |
|||
`crypto_onetimeauth_poly1305_implementation_name()` and |
|||
`crypto_onetimeauth_pick_best_implementation()`. |
|||
- `sodium_compare()` now works as documented, and compares numbers |
|||
in little-endian format instead of behaving like `memcmp()`. |
|||
- The previous changes should not break actual applications, but to be |
|||
safe, the library version major was incremented. |
|||
- `sodium_runtime_has_ssse3()` and `sodium_runtime_has_sse41()` have |
|||
been added. |
|||
- The library can now be compiled with the CompCert compiler. |
|||
|
|||
* Version 1.0.5 |
|||
- Compilation issues on some platforms were fixed: missing alignment |
|||
directives were added (required at least on RHEL-6/i386), a workaround |
|||
for a VRP bug on gcc/armv7 was added, and the library can now be compiled |
|||
with the SunPro compiler. |
|||
- Javascript target: io.js is not supported any more. Use nodejs. |
|||
|
|||
* Version 1.0.4 |
|||
- Support for AES256-GCM has been added. This requires |
|||
a CPU with the aesni and pclmul extensions, and is accessible via the |
|||
crypto_aead_aes256gcm_*() functions. |
|||
- The Javascript target doesn't use eval() any more, so that the |
|||
library can be used in Chrome packaged applications. |
|||
- QNX and CloudABI are now supported. |
|||
- Support for NaCl has finally been added. |
|||
- ChaCha20 with an extended (96 bit) nonce and a 32-bit counter has |
|||
been implemented as crypto_stream_chacha20_ietf(), |
|||
crypto_stream_chacha20_ietf_xor() and crypto_stream_chacha20_ietf_xor_ic(). |
|||
An IETF-compatible version of ChaCha20Poly1305 is available as |
|||
crypto_aead_chacha20poly1305_ietf_npubbytes(), |
|||
crypto_aead_chacha20poly1305_ietf_encrypt() and |
|||
crypto_aead_chacha20poly1305_ietf_decrypt(). |
|||
- The sodium_increment() helper function has been added, to increment |
|||
an arbitrary large number (such as a nonce). |
|||
- The sodium_compare() helper function has been added, to compare |
|||
arbitrary large numbers (such as nonces, in order to prevent replay |
|||
attacks). |
|||
|
|||
* Version 1.0.3 |
|||
- In addition to sodium_bin2hex(), sodium_hex2bin() is now a |
|||
constant-time function. |
|||
- crypto_stream_xsalsa20_ic() has been added. |
|||
- crypto_generichash_statebytes(), crypto_auth_*_statebytes() and |
|||
crypto_hash_*_statebytes() have been added in order to retrieve the |
|||
size of structures keeping states from foreign languages. |
|||
- The JavaScript target doesn't require /dev/urandom or an external |
|||
randombytes() implementation any more. Other minor Emscripten-related |
|||
improvements have been made in order to support libsodium.js |
|||
- Custom randombytes implementations do not need to provide their own |
|||
implementation of randombytes_uniform() any more. randombytes_stir() |
|||
and randombytes_close() can also be NULL pointers if they are not |
|||
required. |
|||
- On Linux, getrandom(2) is being used instead of directly accessing |
|||
/dev/urandom, if the kernel supports this system call. |
|||
- crypto_box_seal() and crypto_box_seal_open() have been added. |
|||
- Visual Studio 2015 is now supported. |
|||
|
|||
* Version 1.0.2 |
|||
- The _easy and _detached APIs now support precalculated keys; |
|||
crypto_box_easy_afternm(), crypto_box_open_easy_afternm(), |
|||
crypto_box_detached_afternm() and crypto_box_open_detached_afternm() |
|||
have been added as an alternative to the NaCl interface. |
|||
- Memory allocation functions can now be used on operating systems with |
|||
no memory protection. |
|||
- crypto_sign_open() and crypto_sign_edwards25519sha512batch_open() |
|||
now accept a NULL pointer instead of a pointer to the message size, if |
|||
storing this information is not required. |
|||
- The close-on-exec flag is now set on the descriptor returned when |
|||
opening /dev/urandom. |
|||
- A libsodium-uninstalled.pc file to use pkg-config even when |
|||
libsodium is not installed, has been added. |
|||
- The iOS target now includes armv7s and arm64 optimized code, as well |
|||
as i386 and x86_64 code for the iOS simulator. |
|||
- sodium_free() can now be called on regions with PROT_NONE protection. |
|||
- The Javascript tests can run on Ubuntu, where the node binary was |
|||
renamed nodejs. io.js can also be used instead of node. |
|||
|
|||
* Version 1.0.1 |
|||
- DLL_EXPORT was renamed SODIUM_DLL_EXPORT in order to avoid |
|||
collisions with similar macros defined by other libraries. |
|||
- sodium_bin2hex() is now constant-time. |
|||
- crypto_secretbox_detached() now supports overlapping input and output |
|||
regions. |
|||
- NaCl's donna_c64 implementation of curve25519 was reading an extra byte |
|||
past the end of the buffer containing the base point. This has been |
|||
fixed. |
|||
|
|||
* Version 1.0.0 |
|||
- The API and ABI are now stable. New features will be added, but |
|||
backward-compatibility is guaranteed through all the 1.x.y releases. |
|||
- crypto_sign() properly works with overlapping regions again. Thanks |
|||
to @pysiak for reporting this regression introduced in version 0.6.1. |
|||
- The test suite has been extended. |
|||
|
|||
* Version 0.7.1 (1.0 RC2) |
|||
- This is the second release candidate of Sodium 1.0. Minor |
|||
compilation, readability and portability changes have been made and the |
|||
test suite was improved, but the API is the same as the previous release |
|||
candidate. |
|||
|
|||
* Version 0.7.0 (1.0 RC1) |
|||
- Allocating memory to store sensitive data can now be done using |
|||
sodium_malloc() and sodium_allocarray(). These functions add guard |
|||
pages around the protected data to make it less likely to be |
|||
accessible in a heartbleed-like scenario. In addition, the protection |
|||
for memory regions allocated that way can be changed using |
|||
sodium_mprotect_noaccess(), sodium_mprotect_readonly() and |
|||
sodium_mprotect_readwrite(). |
|||
- ed25519 keys can be converted to curve25519 keys with |
|||
crypto_sign_ed25519_pk_to_curve25519() and |
|||
crypto_sign_ed25519_sk_to_curve25519(). This allows using the same |
|||
keys for signature and encryption. |
|||
- The seed and the public key can be extracted from an ed25519 key |
|||
using crypto_sign_ed25519_sk_to_seed() and crypto_sign_ed25519_sk_to_pk(). |
|||
- aes256 was removed. A timing-attack resistant implementation might |
|||
be added later, but not before version 1.0 is tagged. |
|||
- The crypto_pwhash_scryptxsalsa208sha256_* compatibility layer was |
|||
removed. Use crypto_pwhash_scryptsalsa208sha256_*. |
|||
- The compatibility layer for implementation-specific functions was |
|||
removed. |
|||
- Compilation issues with Mingw64 on MSYS (not MSYS2) were fixed. |
|||
- crypto_pwhash_scryptsalsa208sha256_STRPREFIX was added: it contains |
|||
the prefix produced by crypto_pwhash_scryptsalsa208sha256_str() |
|||
|
|||
* Version 0.6.1 |
|||
- Important bug fix: when crypto_sign_open() was given a signed |
|||
message too short to even contain a signature, it was putting an |
|||
unlimited amount of zeros into the target buffer instead of |
|||
immediately returning -1. The bug was introduced in version 0.5.0. |
|||
- New API: crypto_sign_detached() and crypto_sign_verify_detached() |
|||
to produce and verify ed25519 signatures without having to duplicate |
|||
the message. |
|||
- New ./configure switch: --enable-minimal, to create a smaller |
|||
library, with only the functions required for the high-level API. |
|||
Mainly useful for the JavaScript target and embedded systems. |
|||
- All the symbols are now exported by the Emscripten build script. |
|||
- The pkg-config .pc file is now always installed even if the |
|||
pkg-config tool is not available during the installation. |
|||
|
|||
* Version 0.6.0 |
|||
- The ChaCha20 stream cipher has been added, as crypto_stream_chacha20_* |
|||
- The ChaCha20Poly1305 AEAD construction has been implemented, as |
|||
crypto_aead_chacha20poly1305_* |
|||
- The _easy API does not require any heap allocations any more and |
|||
does not have any overhead over the NaCl API. With the password |
|||
hashing function being an obvious exception, the library doesn't |
|||
allocate and will not allocate heap memory ever. |
|||
- crypto_box and crypto_secretbox have a new _detached API to store |
|||
the authentication tag and the encrypted message separately. |
|||
- crypto_pwhash_scryptxsalsa208sha256*() functions have been renamed |
|||
crypto_pwhash_scryptsalsa208sha256*(). |
|||
- The low-level crypto_pwhash_scryptsalsa208sha256_ll() function |
|||
allows setting individual parameters of the scrypt function. |
|||
- New macros and functions for recommended crypto_pwhash_* parameters |
|||
have been added. |
|||
- Similarly to crypto_sign_seed_keypair(), crypto_box_seed_keypair() |
|||
has been introduced to deterministically generate a key pair from a seed. |
|||
- crypto_onetimeauth() now provides a streaming interface. |
|||
- crypto_stream_chacha20_xor_ic() and crypto_stream_salsa20_xor_ic() |
|||
have been added to use a non-zero initial block counter. |
|||
- On Windows, CryptGenRandom() was replaced by RtlGenRandom(), which |
|||
doesn't require the Crypt API. |
|||
- The high bit in curve25519 is masked instead of processing the key as |
|||
a 256-bit value. |
|||
- The curve25519 ref implementation was replaced by the latest ref10 |
|||
implementation from Supercop. |
|||
- sodium_mlock() now prevents memory from being included in coredumps |
|||
on Linux 3.4+ |
|||
|
|||
* Version 0.5.0 |
|||
- sodium_mlock()/sodium_munlock() have been introduced to lock pages |
|||
in memory before storing sensitive data, and to zero them before |
|||
unlocking them. |
|||
- High-level wrappers for crypto_box and crypto_secretbox |
|||
(crypto_box_easy and crypto_secretbox_easy) can be used to avoid |
|||
dealing with the specific memory layout regular functions depend on. |
|||
- crypto_pwhash_scryptsalsa208sha256* functions have been added |
|||
to derive a key from a password, and for password storage. |
|||
- Salsa20 and ed25519 implementations now support overlapping |
|||
inputs/keys/outputs (changes imported from supercop-20140505). |
|||
- New build scripts for Visual Studio, Emscripten, different Android |
|||
architectures and msys2 are available. |
|||
- The poly1305-53 implementation has been replaced with Floodyberry's |
|||
poly1305-donna32 and poly1305-donna64 implementations. |
|||
- sodium_hex2bin() has been added to complement sodium_bin2hex(). |
|||
- On OpenBSD and Bitrig, arc4random() is used instead of reading |
|||
/dev/urandom. |
|||
- crypto_auth_hmac_sha512() has been implemented. |
|||
- sha256 and sha512 now have a streaming interface. |
|||
- hmacsha256, hmacsha512 and hmacsha512256 now support keys of |
|||
arbitrary length, and have a streaming interface. |
|||
- crypto_verify_64() has been implemented. |
|||
- first-class Visual Studio build system, thanks to @evoskuil |
|||
- CPU features are now detected at runtime. |
|||
|
|||
* Version 0.4.5 |
|||
- Restore compatibility with OSX <= 10.6 |
|||
|
|||
* Version 0.4.4 |
|||
- Visual Studio is officially supported (VC 2010 & VC 2013) |
|||
- mingw64 is now supported |
|||
- big-endian architectures are now supported as well |
|||
- The donna_c64 implementation of curve25519_donna_c64 now handles |
|||
non-canonical points like the ref implementation |
|||
- Missing scalarmult_curve25519 and stream_salsa20 constants are now exported |
|||
- A crypto_onetimeauth_poly1305_ref() wrapper has been added |
|||
|
|||
* Version 0.4.3 |
|||
- crypto_sign_seedbytes() and crypto_sign_SEEDBYTES were added. |
|||
- crypto_onetimeauth_poly1305_implementation_name() was added. |
|||
- poly1305-ref has been replaced by a faster implementation, |
|||
Floodyberry's poly1305-donna-unrolled. |
|||
- Stackmarkings have been added to assembly code, for Hardened Gentoo. |
|||
- pkg-config can now be used in order to retrieve compilations flags for |
|||
using libsodium. |
|||
- crypto_stream_aes256estream_*() can now deal with unaligned input |
|||
on platforms that require word alignment. |
|||
- portability improvements. |
|||
|
|||
* Version 0.4.2 |
|||
- All NaCl constants are now also exposed as functions. |
|||
- The Android and iOS cross-compilation script have been improved. |
|||
- libsodium can now be cross-compiled to Windows from Linux. |
|||
- libsodium can now be compiled with emscripten. |
|||
- New convenience function (prototyped in utils.h): sodium_bin2hex(). |
|||
|
|||
* Version 0.4.1 |
|||
- sodium_version_*() functions were not exported in version 0.4. They |
|||
are now visible as intended. |
|||
- sodium_init() now calls randombytes_stir(). |
|||
- optimized assembly version of salsa20 is now used on amd64. |
|||
- further cleanups and enhanced compatibility with non-C99 compilers. |
|||
|
|||
* Version 0.4 |
|||
- Most constants and operations are now available as actual functions |
|||
instead of macros, making it easier to use from other languages. |
|||
- New operation: crypto_generichash, featuring a variable key size, a |
|||
variable output size, and a streaming API. Currently implemented using |
|||
Blake2b. |
|||
- The package can be compiled in a separate directory. |
|||
- aes128ctr functions are exported. |
|||
- Optimized versions of curve25519 (curve25519_donna_c64), poly1305 |
|||
(poly1305_53) and ed25519 (ed25519_ref10) are available. Optionally calling |
|||
sodium_init() once before using the library makes it pick the fastest |
|||
implementation. |
|||
- New convenience function: sodium_memzero() in order to securely |
|||
wipe a memory area. |
|||
- A whole bunch of cleanups and portability enhancements. |
|||
- On Windows, a .REF file is generated along with the shared library, |
|||
for use with Visual Studio. The installation path for these has become |
|||
$prefix/bin as expected by MingW. |
|||
|
|||
* Version 0.3 |
|||
- The crypto_shorthash operation has been added, implemented using |
|||
SipHash-2-4. |
|||
|
|||
* Version 0.2 |
|||
- crypto_sign_seed_keypair() has been added |
|||
|
|||
* Version 0.1 |
|||
- Initial release. |
|||
|
@ -0,0 +1,18 @@ |
|||
/* |
|||
* ISC License |
|||
* |
|||
* Copyright (c) 2013-2017 |
|||
* Frank Denis <j at pureftpd dot org> |
|||
* |
|||
* Permission to use, copy, modify, and/or distribute this software for any |
|||
* purpose with or without fee is hereby granted, provided that the above |
|||
* copyright notice and this permission notice appear in all copies. |
|||
* |
|||
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES |
|||
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
|||
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR |
|||
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
|||
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
|||
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
|||
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
|||
*/ |
@ -0,0 +1,24 @@ |
|||
ACLOCAL_AMFLAGS = -I m4 |
|||
|
|||
EXTRA_DIST = \
|
|||
autogen.sh \
|
|||
libsodium.sln \
|
|||
libsodium.vcxproj \
|
|||
libsodium.vcxproj.filters \
|
|||
LICENSE \
|
|||
README.markdown \
|
|||
THANKS |
|||
|
|||
SUBDIRS = \
|
|||
builds \
|
|||
contrib \
|
|||
dist-build \
|
|||
msvc-scripts \
|
|||
src \
|
|||
test |
|||
|
|||
pkgconfigdir = $(libdir)/pkgconfig |
|||
pkgconfig_DATA = @PACKAGE_NAME@.pc |
|||
|
|||
DISTCLEANFILES = $(pkgconfig_DATA) |
|||
|
@ -0,0 +1,46 @@ |
|||
[![Build Status](https://travis-ci.org/jedisct1/libsodium.svg?branch=master)](https://travis-ci.org/jedisct1/libsodium?branch=master) |
|||
[![Windows build status](https://ci.appveyor.com/api/projects/status/fu8s2elx25il98hj?svg=true)](https://ci.appveyor.com/project/jedisct1/libsodium) |
|||
[![Coverity Scan Build Status](https://scan.coverity.com/projects/2397/badge.svg)](https://scan.coverity.com/projects/2397) |
|||
|
|||
![libsodium](https://raw.github.com/jedisct1/libsodium/master/logo.png) |
|||
============ |
|||
|
|||
Sodium is a new, easy-to-use software library for encryption, |
|||
decryption, signatures, password hashing and more. |
|||
|
|||
It is a portable, cross-compilable, installable, packageable |
|||
fork of [NaCl](http://nacl.cr.yp.to/), with a compatible API, and an |
|||
extended API to improve usability even further. |
|||
|
|||
Its goal is to provide all of the core operations needed to build |
|||
higher-level cryptographic tools. |
|||
|
|||
Sodium supports a variety of compilers and operating systems, |
|||
including Windows (with MingW or Visual Studio, x86 and x64), iOS, Android, |
|||
as well as Javascript and Webassembly. |
|||
|
|||
## Documentation |
|||
|
|||
The documentation is available on Gitbook: |
|||
|
|||
* [libsodium documentation](https://download.libsodium.org/doc/) - |
|||
online, requires Javascript. |
|||
* [offline documentation](https://www.gitbook.com/book/jedisct1/libsodium/details) |
|||
in PDF, MOBI and ePUB formats. |
|||
|
|||
## Integrity Checking |
|||
|
|||
The integrity checking instructions (including the signing key for libsodium) |
|||
are available in the [installation](https://download.libsodium.org/doc/installation/index.html#integrity-checking) |
|||
section of the documentation. |
|||
|
|||
## Community |
|||
|
|||
A mailing-list is available to discuss libsodium. |
|||
|
|||
In order to join, just send a random mail to `sodium-subscribe` {at} |
|||
`pureftpd` {dot} `org`. |
|||
|
|||
## License |
|||
|
|||
[ISC license](https://en.wikipedia.org/wiki/ISC_license). |
@ -0,0 +1,91 @@ |
|||
Special thanks to people, companies and organizations having written |
|||
libsodium bindings for their favorite programming languages: |
|||
|
|||
@alethia7 |
|||
@artemisc |
|||
@carblue |
|||
@dnaq |
|||
@ektrah |
|||
@graxrabble |
|||
@harleqin |
|||
@joshjdevl |
|||
@jrmarino |
|||
@jshahbazi |
|||
@lvh |
|||
@neheb |
|||
|
|||
Adam Caudill (@adamcaudill) |
|||
Alexander Morris (@alexpmorris) |
|||
Amit Murthy (@amitmurthy) |
|||
Andrew Bennett (@potatosalad) |
|||
Andrew Lambert (@charonn0) |
|||
Bruce Mitchener (@waywardmonkeys) |
|||
Bruno Oliveira (@abstractj) |
|||
Caolan McMahon (@caolan) |
|||
Chris Rebert (@cvrebert) |
|||
Christian Hermann (@bitbeans) |
|||
Christian Wiese (@morfoh) |
|||
Christian Wiese (@morfoh) |
|||
Colm MacCárthaigh (@colmmacc) |
|||
David Parrish (@dmp1ce) |
|||
Donald Stufft (@dstufft) |
|||
Douglas Campos (@qmx) |
|||
Drew Crawford (@drewcrawford) |
|||
Emil Bay (@emilbayes) |
|||
Eric Dong (@quantum1423) |
|||
Eric Voskuil (@evoskuil) |
|||
Farid Hajji (@fhajji) |
|||
Frank Siebenlist (@franks42) |
|||
Gabriel Handford (@gabriel) |
|||
Geo Carncross (@geocar) |
|||
Henrik Gassmann (BurningEnlightenment) |
|||
Jachym Holecek (@freza) |
|||
Jack Wink (@jackwink) |
|||
James Ruan (@jamesruan) |
|||
Jan de Muijnck-Hughes (@jfdm) |
|||
Jason McCampbell (@jasonmccampbell) |
|||
Jeroen Habraken (@VeXocide) |
|||
Jeroen Ooms (@jeroen) |
|||
Jesper Louis Andersen (@jlouis) |
|||
Joe Eli McIlvain (@jemc) |
|||
Jonathan Stowe (@jonathanstowe) |
|||
Joseph Abrahamson (@tel) |
|||
Julien Kauffmann (@ereOn) |
|||
Kenneth Ballenegger (@kballenegger) |
|||
Loic Maury (@loicmaury) |
|||
Michael Gorlick (@mgorlick) |
|||
Michael Gregorowicz (@mgregoro) |
|||
Michał Zieliński (@zielmicha) |
|||
Omar Ayub (@electricFeel) |
|||
Pedro Paixao (@paixaop) |
|||
Project ArteMisc (@artemisc) |
|||
Rich FitzJohn (@richfitz) |
|||
Ruben De Visscher (@rubendv) |
|||
Rudolf Von Krugstein (@rudolfvonkrugstein) |
|||
Samuel Neves (@sneves) |
|||
Scott Arciszewski (@paragonie-scott) |
|||
Stanislav Ovsiannikov (@naphaso) |
|||
Stefan Marsiske (@stef) |
|||
Stephan Touset (@stouset) |
|||
Stephen Chavez (@redragonx) |
|||
Steve Gibson (@sggrc) |
|||
Tony Arcieri (@bascule) |
|||
Tony Garnock-Jones (@tonyg) |
|||
Y. T. Chung (@zonyitoo) |
|||
|
|||
Bytecurry Software |
|||
Cryptotronix |
|||
Facebook |
|||
FSF France |
|||
MaidSafe |
|||
Paragonie Initiative Enterprises |
|||
Python Cryptographic Authority |
|||
|
|||
(this list may not be complete, if you don't see your name, please |
|||
submit a pull request!) |
|||
|
|||
Also thanks to: |
|||
|
|||
- Coverity, Inc. to provide static analysis. |
|||
- FSF France for providing access to their compilation servers. |
|||
- Private Internet Access for having sponsored a complete security audit. |
@ -0,0 +1,25 @@ |
|||
version: 1.0.10.{build} |
|||
|
|||
os: Visual Studio 2015 |
|||
|
|||
environment: |
|||
matrix: |
|||
- platform: Win32 |
|||
configuration: Debug |
|||
- platform: Win32 |
|||
configuration: Release |
|||
- platform: x64 |
|||
configuration: Debug |
|||
- platform: x64 |
|||
configuration: Release |
|||
|
|||
matrix: |
|||
fast_finish: false |
|||
|
|||
init: |
|||
msbuild /version |
|||
|
|||
build: |
|||
parallel: true |
|||
project: libsodium.vcxproj |
|||
verbosity: minimal |
@ -0,0 +1,36 @@ |
|||
#! /bin/sh |
|||
|
|||
if glibtoolize --version > /dev/null 2>&1; then |
|||
LIBTOOLIZE='glibtoolize' |
|||
else |
|||
LIBTOOLIZE='libtoolize' |
|||
fi |
|||
|
|||
command -v command >/dev/null 2>&1 || { |
|||
echo "command is required, but wasn't found on this system" |
|||
exit 1 |
|||
} |
|||
|
|||
command -v $LIBTOOLIZE >/dev/null 2>&1 || { |
|||
echo "libtool is required, but wasn't found on this system" |
|||
exit 1 |
|||
} |
|||
|
|||
command -v autoconf >/dev/null 2>&1 || { |
|||
echo "autoconf is required, but wasn't found on this system" |
|||
exit 1 |
|||
} |
|||
|
|||
command -v automake >/dev/null 2>&1 || { |
|||
echo "automake is required, but wasn't found on this system" |
|||
exit 1 |
|||
} |
|||
|
|||
if autoreconf --version > /dev/null 2>&1 ; then |
|||
exec autoreconf -ivf |
|||
fi |
|||
|
|||
$LIBTOOLIZE && \ |
|||
aclocal && \ |
|||
automake --add-missing --force-missing --include-deps && \ |
|||
autoconf |
Some files were not shown because too many files changed in this diff
Loading…
Reference in new issue