|
|
|
@ -13,10 +13,24 @@ |
|
|
|
* * |
|
|
|
******************************************************************************/ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef FROM_JS |
|
|
|
#include "OS_portable.h" |
|
|
|
#define LIQUIDITY_PROVIDER 1 |
|
|
|
|
|
|
|
/*#define malloc(n) LP_alloc(n)
|
|
|
|
#define realloc(ptr,n) LP_realloc(ptr,n) |
|
|
|
#define calloc(a,b) LP_alloc((uint64_t)(a) * (b)) |
|
|
|
#define free(ptr) LP_free(ptr) |
|
|
|
#define clonestr(str) LP_clonestr(str) |
|
|
|
|
|
|
|
void *LP_realloc(void *ptr,uint64_t len); |
|
|
|
void *LP_alloc(uint64_t len); |
|
|
|
void LP_free(void *ptr); |
|
|
|
char *LP_clonestr(char *str);*/ |
|
|
|
|
|
|
|
|
|
|
|
#if LIQUIDITY_PROVIDER |
|
|
|
#include <curl/curl.h> |
|
|
|
#include <curl/easy.h> |
|
|
|
@ -31,8 +45,11 @@ struct return_string { |
|
|
|
size_t len; |
|
|
|
}; |
|
|
|
|
|
|
|
struct MemoryStruct { char *memory; size_t size,allocsize; }; |
|
|
|
|
|
|
|
size_t accumulate(void *ptr, size_t size, size_t nmemb, struct return_string *s); |
|
|
|
void init_string(struct return_string *s); |
|
|
|
static size_t WriteMemoryCallback(void *ptr,size_t size,size_t nmemb,void *data); |
|
|
|
|
|
|
|
|
|
|
|
/************************************************************************
|
|
|
|
@ -78,7 +95,7 @@ char *post_process_bitcoind_RPC(char *debugstr,char *command,char *rpcstr,char * |
|
|
|
{ |
|
|
|
if ( (error->type&0xff) == cJSON_NULL && (result->type&0xff) != cJSON_NULL ) |
|
|
|
{ |
|
|
|
retstr = cJSON_Print(result); |
|
|
|
retstr = jprint(result,0); |
|
|
|
len = strlen(retstr); |
|
|
|
if ( retstr[0] == '"' && retstr[len-1] == '"' ) |
|
|
|
{ |
|
|
|
@ -122,8 +139,9 @@ char *Jay_NXTrequest(char *command,char *params) |
|
|
|
char *bitcoind_RPC(char **retstrp,char *debugstr,char *url,char *userpass,char *command,char *params,int32_t timeout) |
|
|
|
{ |
|
|
|
static int didinit,count,count2; static double elapsedsum,elapsedsum2; extern int32_t USE_JAY; |
|
|
|
struct MemoryStruct chunk; |
|
|
|
struct curl_slist *headers = NULL; struct return_string s; CURLcode res; CURL *curl_handle; |
|
|
|
char *bracket0,*bracket1,*databuf = 0; long len; int32_t specialcase,numretries; double starttime; |
|
|
|
char *bracket0,*bracket1,*retstr,*databuf = 0; long len; int32_t specialcase,numretries; double starttime; |
|
|
|
if ( didinit == 0 ) |
|
|
|
{ |
|
|
|
didinit = 1; |
|
|
|
@ -147,14 +165,24 @@ try_again: |
|
|
|
*retstrp = 0; |
|
|
|
starttime = OS_milliseconds(); |
|
|
|
curl_handle = curl_easy_init(); |
|
|
|
init_string(&s); |
|
|
|
headers = curl_slist_append(0,"Expect:"); |
|
|
|
|
|
|
|
curl_easy_setopt(curl_handle,CURLOPT_USERAGENT,"mozilla/4.0");//"Mozilla/4.0 (compatible; )");
|
|
|
|
curl_easy_setopt(curl_handle,CURLOPT_HTTPHEADER, headers); |
|
|
|
curl_easy_setopt(curl_handle,CURLOPT_URL, url); |
|
|
|
curl_easy_setopt(curl_handle,CURLOPT_WRITEFUNCTION, (void *)accumulate); // send all data to this function
|
|
|
|
curl_easy_setopt(curl_handle,CURLOPT_WRITEDATA, &s); // we pass our 's' struct to the callback
|
|
|
|
if ( (0) ) |
|
|
|
{ |
|
|
|
init_string(&s); |
|
|
|
curl_easy_setopt(curl_handle,CURLOPT_WRITEFUNCTION, (void *)accumulate); // send all data to this function
|
|
|
|
curl_easy_setopt(curl_handle,CURLOPT_WRITEDATA, &s); // we pass our 's' struct to the callback
|
|
|
|
} |
|
|
|
else |
|
|
|
{ |
|
|
|
memset(&chunk,0,sizeof(chunk)); |
|
|
|
curl_easy_setopt(curl_handle,CURLOPT_WRITEFUNCTION,WriteMemoryCallback); |
|
|
|
curl_easy_setopt(curl_handle,CURLOPT_WRITEDATA,(void *)&chunk); |
|
|
|
|
|
|
|
} |
|
|
|
curl_easy_setopt(curl_handle,CURLOPT_NOSIGNAL, 1L); // supposed to fix "Alarm clock" and long jump crash
|
|
|
|
curl_easy_setopt(curl_handle,CURLOPT_NOPROGRESS, 1L); // no progress callback
|
|
|
|
if ( timeout > 0 ) |
|
|
|
@ -209,23 +237,24 @@ try_again: |
|
|
|
if ( specialcase != 0 || timeout != 0 ) |
|
|
|
{ |
|
|
|
//printf("<<<<<<<<<<< bitcoind_RPC.(%s): BTCD.%s timeout params.(%s) s.ptr.(%s) err.%d\n",url,command,params,s.ptr,res);
|
|
|
|
free(s.ptr); |
|
|
|
free(chunk.memory); //free(s.ptr);
|
|
|
|
return(0); |
|
|
|
} |
|
|
|
else if ( numretries >= 4 ) |
|
|
|
{ |
|
|
|
printf( "curl_easy_perform() failed: %s %s.(%s %s), retries: %d\n",curl_easy_strerror(res),debugstr,url,command,numretries); |
|
|
|
//printf("Maximum number of retries exceeded!\n");
|
|
|
|
free(s.ptr); |
|
|
|
free(chunk.memory);//free(s.ptr);
|
|
|
|
return(0); |
|
|
|
} |
|
|
|
free(s.ptr); |
|
|
|
free(chunk.memory);//free(s.ptr);
|
|
|
|
sleep((1<<numretries)); |
|
|
|
goto try_again; |
|
|
|
|
|
|
|
} |
|
|
|
else |
|
|
|
{ |
|
|
|
retstr = chunk.memory; // retstr = s.ptr;
|
|
|
|
if ( command != 0 && specialcase == 0 ) |
|
|
|
{ |
|
|
|
count++; |
|
|
|
@ -234,20 +263,20 @@ try_again: |
|
|
|
printf("%d: ave %9.6f | elapsed %.3f millis | bitcoind_RPC.(%s) url.(%s)\n",count,elapsedsum/count,(OS_milliseconds() - starttime),command,url); |
|
|
|
if ( retstrp != 0 ) |
|
|
|
{ |
|
|
|
*retstrp = s.ptr; |
|
|
|
return(s.ptr); |
|
|
|
*retstrp = retstr; |
|
|
|
return(retstr); |
|
|
|
} |
|
|
|
return(post_process_bitcoind_RPC(debugstr,command,s.ptr,params)); |
|
|
|
return(post_process_bitcoind_RPC(debugstr,command,retstr,params)); |
|
|
|
} |
|
|
|
else |
|
|
|
{ |
|
|
|
if ( (0) && specialcase != 0 ) |
|
|
|
fprintf(stderr,"<<<<<<<<<<< bitcoind_RPC: BTCD.(%s) -> (%s)\n",params,s.ptr); |
|
|
|
fprintf(stderr,"<<<<<<<<<<< bitcoind_RPC: BTCD.(%s) -> (%s)\n",params,retstr); |
|
|
|
count2++; |
|
|
|
elapsedsum2 += (OS_milliseconds() - starttime); |
|
|
|
if ( (count2 % 10000) == 0) |
|
|
|
printf("%d: ave %9.6f | elapsed %.3f millis | NXT calls.(%s) cmd.(%s)\n",count2,elapsedsum2/count2,(double)(OS_milliseconds() - starttime),url,command); |
|
|
|
return(s.ptr); |
|
|
|
return(retstr); |
|
|
|
} |
|
|
|
} |
|
|
|
//printf("bitcoind_RPC: impossible case\n");
|
|
|
|
@ -294,13 +323,23 @@ size_t accumulate(void *ptr,size_t size,size_t nmemb,struct return_string *s) |
|
|
|
return(size * nmemb); |
|
|
|
} |
|
|
|
|
|
|
|
struct MemoryStruct { char *memory; size_t size; }; |
|
|
|
|
|
|
|
static size_t WriteMemoryCallback(void *ptr,size_t size,size_t nmemb,void *data) |
|
|
|
{ |
|
|
|
size_t realsize = (size * nmemb); |
|
|
|
size_t needed,realsize = (size * nmemb); |
|
|
|
struct MemoryStruct *mem = (struct MemoryStruct *)data; |
|
|
|
mem->memory = (ptr != 0) ? realloc(mem->memory,mem->size + realsize + 1) : malloc(mem->size + realsize + 1); |
|
|
|
needed = mem->size + realsize + 1; |
|
|
|
if ( ptr == 0 && needed < 256 ) |
|
|
|
{ |
|
|
|
mem->allocsize = 256; |
|
|
|
mem->memory = malloc(mem->allocsize); |
|
|
|
} |
|
|
|
if ( mem->allocsize < needed ) |
|
|
|
{ |
|
|
|
//printf("curl needs %d more\n",(int32_t)realsize);
|
|
|
|
mem->memory = (ptr != 0) ? realloc(mem->memory,needed) : malloc(needed); |
|
|
|
mem->allocsize = needed; |
|
|
|
} |
|
|
|
//mem->memory = (ptr != 0) ? realloc(mem->memory,mem->size + realsize + 1) : malloc(mem->size + realsize + 1);
|
|
|
|
if ( mem->memory != 0 ) |
|
|
|
{ |
|
|
|
if ( ptr != 0 ) |
|
|
|
|
DeckerSU
7 years ago