/******************************************************************************
* Copyright © 2014 - 2016 The SuperNET Developers . *
* *
* See the AUTHORS , DEVELOPER - AGREEMENT and LICENSE files at *
* the top - level directory of this distribution for the individual copyright *
* holder information and the developer policies on copyright and licensing . *
* *
* Unless otherwise agreed in a custom licensing agreement , no part of the *
* SuperNET software , including this file may be copied , modified , propagated *
* or distributed except according to the terms contained in the LICENSE file *
* *
* Removal or modification of this copyright notice is prohibited . *
* *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
// iguana_OS has functions that invoke system calls. Whenever possible stdio and similar functions are use and most functions are fully portable and in this file. For things that require OS specific, the call is routed to iguana_OS_portable_* Usually, all but one OS can be handled with the same code, so iguana_OS_portable.c has most of this shared logic and an #ifdef iguana_OS_nonportable.c
// time functions are treated separately due to the confusions even in unix
# include "OS_portable.h"
# include <sys/stat.h>
# ifndef _WIN32
# include <sys/select.h>
# endif
# ifndef MAP_FILE
# define MAP_FILE 0
# endif
many changes
blockexplorer tab: needs to allow to input height, blockhash or txid.
also please display images/BTC_blocks.jpg below the text as a w800 x
h400 bitmap, which is active using the mouse api
for coin management, below the active coins have a form that arbitrary
json can be input with an add button to the right that will call
"addcoin" API. this way I can test adding new coins dynamically. dont
worry if it doesnt work, just as long as it submits the json to the C
code. I am pretty sure I need to do some debugging of this
peers management is not working for me at all. maybe it is due to bad
internet. On initialization you need to read in the
confs/BTCD_peers.txt from the native filesystem and save it into the
chrome app filesystem. same thing for confs/BTCD_hdrs.txt. But this is
only to be done if there isnt already such a file inside chrome. if
there is, only do it upon a button invoked by the user. the reason is
that the pexe is updating this file with the latest. Maybe it is nice
to have an "extract" button that will copy out from the chrome storage
into the native filesystem. There is also the manifest issue about
localstorage vs chrome.localstorage. not sure what is needed to be
done, but certainly a priority to get it so everything works as a
chrome app. I know before it was making ramchain files inside the
chrome filesystem, so it is probably things the GUI is doing. maybe in
the settings tab, which has obsolete stuff that can be removed.
anyway, the issue about files existing in the native filesystem ->
chrome and optionally extracting them is an issue for the confs files
and .html template files used to autogenerate the port7778, maybe other
files are affected. i think we need a way to have a list of hardcoded
files that are just copied into chrome on startup if they dont exist
already (or if possible copy over if the native version is bigger?) and
buttons to extract them
for debug tab:
THREE_STRINGS(SuperNET,encryptjson,passphrase,permanentfile,anything);
TWO_STRINGS(SuperNET,decryptjson,passphrase,permanentfile);
at the top of page a way to put in passphrase and optional
permanentfile along with arbitrary json. The standard form template has
no easy way to describe to pass in everything as it is oriented to
specific fields. but the encryptjson API saves all the fields, so the
arbitrary json from the form needs to be combined at the same level as
the "agent", "method", etc. I know, not the best, but internally it
makes it easier. so
{"agent":"SuperNET","method":"encryptjson","passphrase":"<passphrase>","
permanentfile":"<filename>","fromform":"valuefromform","fromform2":"valu
efromform2",...rest of form at top level}
then this will save it into a file with crazy number (it is a hash like
txid) but given the same passphrase and filename, it will regenerate
this hash so you dont actually have to store it, but it helps during
debugging.
for the filename, we must warn quite strongly to the user that if the
file is ever lost or even changed in any way that the data will not be
recoverable. also best to not allow the user to specify a file that
does not exist. I think at this point chrome app version gets a bit
tricky. we could simply push the native file into the chrome storage,
but then an attacker who gets access to the computer could just get a
list of these files and it really wont be much protection. So that
means if a filename is specified, it needs to be copied into the chrome
space, then immediately deleted... ok, this seems like not a good
approach. let us make it so that the permanentfile option is not
available from the chrome app, but only if the native version is
running. that way we sidestep the issue of the pexe not having access
to the specified file.
Speaking of native vs pexe, on the startup page we should have a radio
button that allows the user to select which the GUI will talk to. It
should default based on a self test to the more likely value, but it is
possible that the user wants to use the native version, even if the
pexe is running.
another thing to have on the startup page is a simple login:
THREE_STRINGS(SuperNET,login,passphrase,permanentfile,handle);
ZERO_ARGS(SuperNET,logout);
ZERO_ARGS(SuperNET,activehandle);
the handle is a human readable name that is associated with the
passphrase/permanentfile. There can only be one active account (though
it will be possible to associate different accounts with tradebots).
use the activehandle API to find out who is logged in and the
associated addresses and pubkeys
The above is not yet tested so if it doesnt work, dont fret, just let
me know. Once set the handle can be displayed in various places to let
the user know which account is logged in. The standard 12 dictionary
word passphrases should be used, but any string can be sent in as the
password
for Pangea:
INT_AND_ARRAY(pangea,host,minplayers,params);
ZERO_ARGS(pangea,lobby);
HASH_AND_STRING(pangea,join,tablehash,handle);
HASH_AND_INT(pangea,buyin,tablehash,numchips);
HASH_ARG(pangea,start,tablehash); // by host only
HASH_ARG(pangea,status,tablehash);
HASH_ARG(pangea,call,tablehash);
HASH_ARG(pangea,check,tablehash);
HASH_AND_INT(pangea,raise,tablehash,numchips);
HASH_AND_INT(pangea,bet,tablehash,numchips);
HASH_ARG(pangea,fold,tablehash);
HASH_AND_STRING(pangea,mode,tablehash,modestr);
HASH_ARG(pangea,history,tablehash);
HASH_AND_INT(pangea,handhistory,tablehash,hand);
The first thing that is done is a "host" by any node. the "params"
should be an arbitrary json (like encryptjson) as it needs to be at the
top level and it has quite a few different parameters still subject to
change. The lobby API will just display all the hosted tables.
once a table exists, players can join and then buyin. the buyin is
denominated in chips, each chip's value is determined by the host's
initial parameters.
once there are enough players joined with adequate buyin's verified,
the host will be able to do a start. if done before it will
(eventually) give an error. for now it will just proceed.
The host and players that have joined a tablehash, need to do regular
status calls to see if the game has started. Probably just once per 5
or even 10 seconds is fine before the start. Once the game starts (the
status will have this info) then once per second polling is needed.
Then when it is your turn (as indicated by status) you need to do one
of the 5 actions (fold, call, check, raise, bet). do not worry if you
dont understand what all these do, just allow the user to do any of
these. I guess it is possible to submit it ahead of time. I will
support internally remembering the most recent action done prior to it
being your turn. once it is your turn and an action is sent to the
table, it is too late to change.
The last API calls are for getting handhistory where hand is 0 to N-1,
being the numbering of the hands played at that table. if just history,
all the history for all hands at the table is coming back, so it could
be quite big. probably I will make it a summary, but for the GUI just
display the returned values.
the mode is to change some poker specific modes, so just allow there to
be a string entered.
do not worry about understanding the pokerness of the API, just the
overall flow:
host -> creates, join/buyin -> fills up player slots, start -> starts
the game
status -> to determine when the game starts (or if it is cancelled) and
once started
actions -> game specific but basically just (button + arg) that is the
user input
results are via status for current game and history for past ones
please try to do the above logic in a generic way so it can be reused
for other games. The basic flow should be the same for almost all
multiplayer turn based games and even for multiplayer realtime games
For InstantDEX:
on the apikeypair/userid there needs to be two modes. one for when
there is no stored apikey and the current form is fine, just need to
make it wider as most apikeys are quite long. Now once there is an
apikey saved all that is needed is the passphrase to unlock it. So here
is where the encrptjson/decryptjson is used. When saving the apikey for
the first time, it can be:
a) not saved -> nothing extra to do
b) saved without password -> you can just save to a file and use it to
load it back in. use confs dir confs/instantdex.exchange.api or
something like that
c) saved with password (optional filename for native) -> probably best
to save in the confs dir to indicate that there is an encrypted file
for this, so just that and not the actual passphrase in the file
with the above, when the exchange is selected, you can see if the confs
file exists and if it has the plaintext, just populate the field, if
not, then indicate that a passphrase is needed. if the user provides
the passphrase, then decryptjson and populate the fields and autosubmit.
A special case is to encrypt the apikeys with the passphrase used when
logging in. This is only available if the checkbox to "remember
passphrase during session" is set on the main iguana login screen. (i
forgot to mention that checkbox!) So the login passphrase is stored in
memory, then the GUI simply uses that + encryptjson for
storing/decrypting. I would imagine that storing in the confs file that
it is encrypted using "handle"'s account login might be a good way to
differentiate between this mode of password usage.
OK, so we now have the insecure plaintext, the decent using handle's
passphrase and paranoid different passphrase for each exchange (with
additional permanentfile for native versions)
"SUPPORT" -> "SUPPORTS" just a typo
and "allpairs" API is missing from the selection
Might as well add a "tradebots" tab:
THREE_STRINGS_AND_DOUBLE(tradebot,monitor,exchange,base,rel,commission);
STRING_AND_DOUBLE(tradebot,monitorall,exchange,commission);
THREE_STRINGS(tradebot,unmonitor,exchange,base,rel);
THREE_STRINGS_AND_THREE_DOUBLES(tradebot,accumulate,exchange,base,rel,pr
ice,volume,duration);
THREE_STRINGS_AND_THREE_DOUBLES(tradebot,divest,exchange,base,rel,price,
volume,duration);
STRING_ARG(tradebot,activebots,exchange);
TWO_STRINGS(tradebot,status,exchange,botid);
TWO_STRINGS(tradebot,pause,exchange,botid);
TWO_STRINGS(tradebot,stop,exchange,botid);
TWO_STRINGS(tradebot,resume,exchange,botid);
the above are API for exchange specific bots, most should be
self-explanatory. bots are created via "accumulate" or "divest" API
call. it returns botid. once created, you can do status, pause, stop,
resume to a botid. and an activebots API call lists all the active bots
for an exchange.
duration is in seconds
the "monitor" API starts background monitoring of a specific base/rel,
"unmonitor" stops this. "monitorall" just does a monitor to the entire
list of "allpairs" for that exchange. Keep in mind that doing a
monitorall will not add load to an exchange as the request to each
exchange is governed by pollgap, but if you have 3 things monitored, it
will take 3*pollgap + time each one takes to execute. and if N are
monitored it is N*pollgap + time of each, with the "time of each"
possibly taking a very long time.
And one final request for today: Bitmap tab.
It should be an active bitmap using mouse api. either a dropdown to
select the bitmap or a form entry. then the rest of the page (resize
the bitmap to the page size) being the active bitmap. So on a small
screen the bitmap is smaller x/y dimensions and larger on larger
screens. plz make sure the proper dimensions are communicated to the
pexe via API if it ever is changed.
@vineet.bhargav86: I changed the "passphrase" fieldname to "password"
for the encryptjson/decryptjson related API. The reason is that the
password is like a wallet password and is only local, so it doesnt need
to be as high entropy as passphrase. I also added a field to the login
API as I realized that the 12 word "passphrase" is the payload and
usually wont be sent in:
FOUR_STRINGS(SuperNET,login,handle,password,permanentfile,passphrase);
using "abiglongpassword" for the passphrase ->
{"pubkey":"6c469ba10b40b3eb9d1dba569d7f929d55a29d8f97cd5425907ef2f38f906
209","RS":"NXT-KGV9-DXX8-TM86-DXR96","NXT":"12834974574569896807","btcpu
bkey":"024e7641dc947b211bc30fe3339765258902794687b227121fc217284f9d8503c
8","rmd160":"33453c24914db7b77069b7ea24df44f6be145938","BTC":"15g6QK2dSd
iW9ZTQEnnJxKrSph6uP7uU23","BTCD":"RDxHUpuv3TX5DZpbhxmS3rBeaxZW1fvYvC","r
esult":"success","handle":"test","tag":"14805226009240621255"}
and if you use that to log into NXT, it gives the same address. The BTC
and BTCD addresses are all derived from the same privkey so they are
all interchangeable with the NXT address. The user can therefore select
which coin's addressing they are most comfortable with
I also added an "allin" action API for pangea. all the action API will
autocalculate the number of chips if passed in 0 for numchips
***************** security issue ********
please dont use the GET URL method when dealing with passphrase!!!
Those URL's tend to get logged and available in browser histories. so
anything dealing with the actual passphrase needs to use the postCall
form or POST
9 years ago
char * OS_mvstr ( )
{
# ifdef __WIN32
return ( " rename " ) ;
# else
return ( " mv " ) ;
# endif
}
void OS_randombytes ( unsigned char * x , long xlen )
{
OS_portable_randombytes ( x , xlen ) ;
}
static double _kb ( double n ) { return ( n / 1024. ) ; }
static double _mb ( double n ) { return ( n / ( 1024. * 1024. ) ) ; }
static double _gb ( double n ) { return ( n / ( 1024. * 1024. * 1024. ) ) ; }
char * mbstr ( char * str , double n )
{
if ( n < 1024 * 1024 * 10 )
sprintf ( str , " %.3fkb " , _kb ( n ) ) ;
else if ( n < 1024 * 1024 * 1024 )
sprintf ( str , " %.1fMB " , _mb ( n ) ) ;
else
sprintf ( str , " %.2fGB " , _gb ( n ) ) ;
return ( str ) ;
}
long myallocated ( uint8_t type , long change )
{
static int64_t Total_allocated , HWM_allocated , Type_allocated [ 256 ] ;
int32_t i ; int64_t total = 0 ; char buf [ 2049 ] , str [ 65 ] ;
buf [ 0 ] = 0 ;
if ( type = = 0 & & change < = 0 )
{
for ( i = 0 ; i < 256 ; i + + )
{
if ( Type_allocated [ i ] ! = 0 )
{
total + = Type_allocated [ i ] ;
if ( change = = 0 )
sprintf ( buf + strlen ( buf ) , " (%c %s) " , i , mbstr ( str , Type_allocated [ i ] ) ) ;
}
}
if ( change = = 0 )
{
sprintf ( buf + strlen ( buf ) , " -> total %lld %s " , ( long long ) total , mbstr ( str , total ) ) ;
printf ( " %s \n " , buf ) ;
}
}
else
{
Type_allocated [ type ] + = change ;
Total_allocated + = change ;
if ( Total_allocated > HWM_allocated )
{
HWM_allocated = Total_allocated * 1.5 ;
printf ( " HWM allocated %ld %s \n " , ( long ) Total_allocated , mbstr ( str , Total_allocated ) ) ;
}
}
return ( total ) ;
}
void * mycalloc ( uint8_t type , int32_t n , long itemsize )
{
//static portable_mutex_t MEMmutex;
struct allocitem * item ; int64_t allocsize = ( ( uint64_t ) n * itemsize ) ;
if ( type = = 0 & & n = = 0 & & itemsize = = 0 )
{
//portable_mutex_init(&MEMmutex);
myfree ( mycalloc ( ' t ' , 1024 , 1024 * 32 ) , 1024 * 1024 * 32 ) ;
return ( 0 ) ;
}
//portable_mutex_lock(&MEMmutex);
myallocated ( type , allocsize ) ;
while ( ( item = calloc ( 1 , sizeof ( struct allocitem ) + allocsize + 16 ) ) = = 0 )
{
char str [ 65 ] ;
printf ( " mycalloc.%c: need to wait for memory.(%d,%ld) %s to be available \n " , type , n , itemsize , mbstr ( str , allocsize ) ) ;
sleep ( 1 ) ;
}
//printf("calloc origptr.%p retptr.%p size.%ld\n",item,(void *)(long)item + sizeof(*item),allocsize);
item - > allocsize = ( uint32_t ) allocsize ;
item - > type = type ;
//portable_mutex_unlock(&MEMmutex);
return ( ( void * ) ( ( long ) item + sizeof ( * item ) ) ) ;
}
void * queueitem ( char * str )
{
struct queueitem * item ; int32_t n , allocsize ; char * data ; uint8_t type = ' y ' ;
//portable_mutex_lock(&MEMmutex);
n = ( uint32_t ) strlen ( str ) + 1 ;
allocsize = ( uint32_t ) ( sizeof ( struct queueitem ) + n ) ;
myallocated ( type , allocsize ) ;
while ( ( item = calloc ( 1 , allocsize ) ) = = 0 )
{
char str [ 65 ] ;
printf ( " queueitem: need to wait for memory.(%d,%ld) %s to be available \n " , n , ( long ) sizeof ( * item ) , mbstr ( str , allocsize ) ) ;
sleep ( 1 ) ;
}
item - > allocsize = ( uint32_t ) allocsize ;
item - > type = type ;
data = ( void * ) ( long ) ( ( long ) item + sizeof ( * item ) ) ;
memcpy ( data , str , n ) ;
//printf("(%c) queueitem.%p itemdata.%p n.%d allocsize.%d\n",type,item,data,n,allocsize);
//portable_mutex_unlock(&MEMmutex);
return ( data ) ;
}
void _myfree ( uint8_t type , int32_t origallocsize , void * origptr , int32_t allocsize )
{
//portable_mutex_lock(&MEMmutex);
if ( allocsize = = origallocsize )
{
myallocated ( type , - allocsize ) ;
// Type_allocated[type & 0xff] -= allocsize;
// Total_allocated -= allocsize;
//printf("myfree.%p size.%d %d type %x\n",origptr,allocsize,origallocsize,type);
free ( origptr ) ;
}
else
{
printf ( " myfree size error %d vs %d at %p \n " , allocsize , origallocsize , origptr ) ;
static int32_t y , z ;
printf ( " div by zero! %d \n " , y / z ) ;
getchar ( ) ;
}
//portable_mutex_unlock(&MEMmutex);
}
void myfree ( void * _ptr , long allocsize )
{
struct allocitem * item = ( void * ) ( ( long ) _ptr - sizeof ( struct allocitem ) ) ;
if ( allocsize = = 0 )
{
printf ( " myfree zero allocsize %p? \n " , _ptr ) ;
return ;
}
_myfree ( item - > type , item - > allocsize , item , ( uint32_t ) allocsize ) ;
}
void free_queueitem ( void * itemdata )
{
struct queueitem * item = ( void * ) ( ( long ) itemdata - sizeof ( struct queueitem ) ) ;
//printf("freeq item.%p itemdata.%p size.%d\n",item,itemdata,item->allocsize);
_myfree ( item - > type , item - > allocsize , item , item - > allocsize ) ;
}
void * myrealloc ( uint8_t type , void * oldptr , long oldsize , long newsize )
{
void * newptr ;
newptr = mycalloc ( type , 1 , newsize ) ;
//printf("newptr.%p type.%c oldsize.%ld newsize.%ld\n",newptr,type,oldsize,newsize);
if ( oldptr ! = 0 )
{
memcpy ( newptr , oldptr , oldsize < newsize ? oldsize : newsize ) ;
myfree ( oldptr , oldsize ) ;
}
return ( newptr ) ;
}
static uint64_t _align16 ( uint64_t ptrval ) { if ( ( ptrval & 15 ) ! = 0 ) ptrval + = 16 - ( ptrval & 15 ) ; return ( ptrval ) ; }
void * myaligned_alloc ( uint64_t allocsize )
{
void * ptr , * realptr ; uint64_t tmp ;
realptr = mycalloc ( ' A ' , 1 , ( long ) ( allocsize + 16 + sizeof ( realptr ) ) ) ;
tmp = _align16 ( ( long ) realptr + sizeof ( ptr ) ) ;
memcpy ( & ptr , & tmp , sizeof ( ptr ) ) ;
memcpy ( ( void * ) ( ( long ) ptr - sizeof ( realptr ) ) , & realptr , sizeof ( realptr ) ) ;
//printf("aligned_alloc(%llu) realptr.%p -> ptr.%p, diff.%ld\n",(long long)allocsize,realptr,ptr,((long)ptr - (long)realptr));
return ( ptr ) ;
}
int32_t myaligned_free ( void * ptr , long size )
{
void * realptr ;
long diff ;
if ( ( ( long ) ptr & 0xf ) ! = 0 )
{
printf ( " misaligned ptr.%p being aligned_free \n " , ptr ) ;
return ( - 1 ) ;
}
memcpy ( & realptr , ( void * ) ( ( long ) ptr - sizeof ( realptr ) ) , sizeof ( realptr ) ) ;
diff = ( ( long ) ptr - ( long ) realptr ) ;
if ( diff < ( long ) sizeof ( ptr ) | | diff > 32 )
{
printf ( " ptr %p and realptr %p too far apart %ld \n " , ptr , realptr , diff ) ;
return ( - 2 ) ;
}
//printf("aligned_free: ptr %p -> realptr %p %ld\n",ptr,realptr,diff);
myfree ( realptr , size + 16 + sizeof ( realptr ) ) ;
return ( 0 ) ;
}
void lock_queue ( queue_t * queue )
{
if ( queue - > initflag = = 0 )
{
portable_mutex_init ( & queue - > mutex ) ;
queue - > initflag = 1 ;
}
portable_mutex_lock ( & queue - > mutex ) ;
}
void queue_enqueue ( char * name , queue_t * queue , struct queueitem * origitem , int32_t offsetflag )
{
struct queueitem * item ;
if ( queue - > name [ 0 ] = = 0 & & name ! = 0 & & name [ 0 ] ! = 0 )
strcpy ( queue - > name , name ) ; //,sizeof(queue->name));
if ( origitem = = 0 )
{
printf ( " FATAL type error: queueing empty value \n " ) ; //, getchar();
return ;
}
//fprintf(stderr,"enqueue.(%s) %p offset.%d\n",queue->name,origitem,offsetflag);
lock_queue ( queue ) ;
item = ( struct queueitem * ) ( ( long ) origitem - offsetflag * sizeof ( struct queueitem ) ) ;
DL_APPEND ( queue - > list , item ) ;
portable_mutex_unlock ( & queue - > mutex ) ;
//printf("queue_enqueue name.(%s) origitem.%p append.%p list.%p\n",name,origitem,item,queue->list);
}
void * queue_dequeue ( queue_t * queue , int32_t offsetflag )
{
struct queueitem * item = 0 ;
lock_queue ( queue ) ;
if ( queue - > list ! = 0 )
{
item = queue - > list ;
//printf("queue_dequeue name.(%s) dequeue.%p list.%p\n",queue->name,item,queue->list);
DL_DELETE ( queue - > list , item ) ;
}
portable_mutex_unlock ( & queue - > mutex ) ;
if ( item ! = 0 & & offsetflag ! = 0 )
return ( ( void * ) ( ( long ) item + sizeof ( struct queueitem ) ) ) ;
else return ( item ) ;
}
void * queue_delete ( queue_t * queue , struct queueitem * copy , int32_t copysize , int32_t freeitem )
{
struct allocitem * ptr ;
struct queueitem * item = 0 ;
lock_queue ( queue ) ;
if ( queue - > list ! = 0 )
{
DL_FOREACH ( queue - > list , item )
{
ptr = ( void * ) ( ( long ) item - sizeof ( struct allocitem ) ) ;
if ( item = = copy | | ( ptr - > allocsize = = copysize & & memcmp ( ( void * ) ( ( long ) item + sizeof ( struct queueitem ) ) , ( void * ) ( ( long ) item + sizeof ( struct queueitem ) ) , copysize ) = = 0 ) )
{
DL_DELETE ( queue - > list , item ) ;
portable_mutex_unlock ( & queue - > mutex ) ;
//printf("name.(%s) deleted item.%p list.%p\n",queue->name,item,queue->list);
if ( freeitem ! = 0 )
myfree ( item , copysize ) ;
return ( item ) ;
}
}
}
portable_mutex_unlock ( & queue - > mutex ) ;
return ( 0 ) ;
}
void * queue_free ( queue_t * queue )
{
struct queueitem * item = 0 ;
lock_queue ( queue ) ;
if ( queue - > list ! = 0 )
{
DL_FOREACH ( queue - > list , item )
{
DL_DELETE ( queue - > list , item ) ;
myfree ( item , sizeof ( struct queueitem ) ) ;
}
//printf("name.(%s) dequeue.%p list.%p\n",queue->name,item,queue->list);
}
portable_mutex_unlock ( & queue - > mutex ) ;
return ( 0 ) ;
}
void * queue_clone ( queue_t * clone , queue_t * queue , int32_t size )
{
struct queueitem * ptr , * item = 0 ;
lock_queue ( queue ) ;
if ( queue - > list ! = 0 )
{
DL_FOREACH ( queue - > list , item )
{
ptr = mycalloc ( ' c ' , 1 , sizeof ( * ptr ) ) ;
memcpy ( ptr , item , size ) ;
queue_enqueue ( queue - > name , clone , ptr , 0 ) ;
}
//printf("name.(%s) dequeue.%p list.%p\n",queue->name,item,queue->list);
}
portable_mutex_unlock ( & queue - > mutex ) ;
return ( 0 ) ;
}
int32_t queue_size ( queue_t * queue )
{
int32_t count = 0 ;
struct queueitem * tmp ;
lock_queue ( queue ) ;
DL_COUNT ( queue - > list , tmp , count ) ;
portable_mutex_unlock ( & queue - > mutex ) ;
return count ;
}
void iguana_memreset ( struct OS_memspace * mem )
{
mem - > used = 0 ;
# ifdef IGUANA_PEERALLOC
mem - > availptrs = mem - > outofptrs = mem - > numptrs = 0 ;
memset ( mem - > ptrs , 0 , sizeof ( mem - > ptrs ) ) ;
memset ( mem - > maxsizes , 0 , sizeof ( mem - > maxsizes ) ) ;
memset ( mem - > allocsizes , 0 , sizeof ( mem - > allocsizes ) ) ;
# endif
if ( mem - > threadsafe ! = 0 )
portable_mutex_init ( & mem - > mutex ) ;
}
void iguana_mempurge ( struct OS_memspace * mem )
{
if ( mem - > allocated ! = 0 & & mem - > ptr ! = 0 ) //&& mem->totalsize > 0 )
{
//printf("mempurge.(%s) %ld\n",mem->name,(long)mem->totalsize);
myfree ( mem - > ptr , mem - > totalsize ) , mem - > ptr = 0 ;
}
iguana_memreset ( mem ) ;
mem - > totalsize = 0 ;
}
void * iguana_meminit ( struct OS_memspace * mem , char * name , void * ptr , int64_t totalsize , int32_t threadsafe )
{
strcpy ( mem - > name , name ) ;
if ( ptr = = 0 )
{
if ( mem - > ptr ! = 0 & & mem - > totalsize < totalsize )
{
iguana_mempurge ( mem ) ;
mem - > totalsize = 0 ;
//printf("memptr.%p totalsize.%ld vs totalsize.%ld\n",mem->ptr,(long)mem->totalsize,(long)totalsize);
} //else printf("mem->ptr.%p mem->totalsize %ld\n",mem->ptr,(long)mem->totalsize);
if ( mem - > ptr = = 0 )
{
//static long alloc;
//alloc += totalsize;
//char str[65]; printf("iguana_meminit.(%s) alloc %s\n",name,mbstr(str,totalsize));
if ( ( mem - > ptr = mycalloc ( ' d ' , 1 , totalsize ) ) = = 0 )
{
printf ( " iguana_meminit: cant get %d bytes \n " , ( int32_t ) totalsize ) ;
exit ( - 1 ) ;
return ( 0 ) ;
}
mem - > totalsize = totalsize ;
} //else printf("memptr.%p\n",mem->ptr);
//printf("meminit.(%s) %d vs %ld\n",mem->name,(int32_t)totalsize,(long)mem->totalsize);
mem - > allocated = 1 ;
}
else
{
iguana_mempurge ( mem ) ;
mem - > ptr = ptr ;
mem - > totalsize = totalsize ;
}
mem - > threadsafe = threadsafe ;
iguana_memreset ( mem ) ;
if ( mem - > totalsize = = 0 )
printf ( " meminit.%s ILLEGAL STATE null size \n " , mem - > name ) , getchar ( ) ;
return ( mem - > ptr ) ;
}
int64_t iguana_memallocated ( struct OS_memspace * mem )
{
int64_t avail = ( mem - > totalsize - mem - > used ) ;
# ifdef IGUANA_PEERALLOC
int32_t i ;
for ( i = 0 ; i < mem - > numptrs ; i + + )
if ( mem - > allocsizes [ i ] = = 0 )
avail + = mem - > maxsizes [ i ] ;
# endif
return ( avail ) ;
}
void * iguana_memalloc ( struct OS_memspace * mem , long size , int32_t clearflag )
{
int32_t modval ; void * ptr = 0 ;
if ( mem - > ptr = = 0 )
return ( 0 ) ;
//printf("iguana_memalloc.%s size.%ld used.%llu of %llu, numptrs.%d avail.%d %lld\n",mem->name,size,(long long)mem->used,(long long)mem->totalsize,mem->numptrs,mem->availptrs,(long long)iguana_memallocated(mem));
//if ( mem->threadsafe != 0 )
// portable_mutex_lock(&mem->mutex);
# ifdef IGUANA_PEERALLOC
if ( mem - > availptrs = = mem - > numptrs & & mem - > used > ( mem - > totalsize > > 1 ) )
iguana_memreset ( mem ) ;
# endif
if ( ( mem - > used + size ) < = mem - > totalsize )
{
ptr = ( void * ) ( long ) ( ( ( long ) mem - > ptr + mem - > used ) ) ;
mem - > used + = size ;
if ( size * clearflag ! = 0 )
memset ( ptr , 0 , size ) ;
if ( mem - > alignflag ! = 0 )
{
if ( ( modval = ( mem - > used % mem - > alignflag ) ) ! = 0 )
mem - > used + = mem - > alignflag - modval ;
}
# ifdef IGUANA_PEERALLOC
if ( mem - > numptrs < sizeof ( mem - > ptrs ) / sizeof ( * mem - > ptrs ) )
{
mem - > allocsizes [ mem - > numptrs ] = mem - > maxsizes [ mem - > numptrs ] = ( int32_t ) size ;
mem - > ptrs [ mem - > numptrs + + ] = ptr ;
}
else
{
mem - > outofptrs + + ;
printf ( " iguana_memalloc: numptrs.%d outofptrs.%d \n " , mem - > numptrs , mem - > outofptrs ) ;
}
# endif
//printf(">>>>>>>>> USED.%s alloc %ld used %ld alloc.%ld -> %s %p\n",mem->name,size,(long)mem->used,(long)mem->totalsize,mem->name,ptr);
}
else
{
printf ( " error memalloc mem.%p (%s) alloc %ld used %ld totalsize.%ld -> %s %p \n " , mem , mem - > name , size , ( long ) mem - > used , ( long ) mem - > totalsize , mem - > name , ptr ) ;
ptr = calloc ( 1 , size ) ;
}
//if ( mem->threadsafe != 0 )
// portable_mutex_unlock(&mem->mutex);
return ( ptr ) ;
}
int64_t iguana_memfree ( struct OS_memspace * mem , void * ptr , int32_t size )
{
# ifdef IGUANA_PEERALLOC
int32_t i ; int64_t avail = - 1 ;
if ( mem - > threadsafe ! = 0 )
portable_mutex_lock ( & mem - > mutex ) ;
for ( i = 0 ; i < mem - > numptrs ; i + + )
{
if ( ptr = = mem - > ptrs [ i ] )
{
if ( mem - > allocsizes [ i ] = = size )
{
mem - > availptrs + + ;
mem - > allocsizes [ i ] = 0 ;
avail = ( mem - > totalsize - mem - > used ) ;
//printf("avail %llu\n",(long long)avail);
} else printf ( " iguana_memfree.%s: mismatched size %d for ptr.%p %d \n " , mem - > name , size , ptr , mem - > allocsizes [ i ] ) ;
if ( mem - > threadsafe ! = 0 )
portable_mutex_unlock ( & mem - > mutex ) ;
return ( avail ) ;
}
}
if ( mem - > threadsafe ! = 0 )
portable_mutex_unlock ( & mem - > mutex ) ;
printf ( " iguana_memfree: cant find ptr.%p %d \n " , ptr , size ) ;
return ( avail ) ;
# else
printf ( " iguana_free not supported without #define IGUANA_PEERALLOC \n " ) ;
return ( 0 ) ;
# endif
}
int32_t OS_truncate ( char * fname , long filesize )
{
return ( OS_portable_truncate ( fname , filesize ) ) ;
}
char * OS_compatible_path ( char * str )
{
return ( OS_portable_path ( str ) ) ;
}
int32_t OS_renamefile ( char * fname , char * newfname )
{
return ( OS_portable_renamefile ( fname , newfname ) ) ;
}
int32_t OS_removefile ( char * fname , int32_t scrubflag )
{
FILE * fp ; long i , fpos ; char tmp [ 512 ] ;
strcpy ( tmp , fname ) ;
OS_compatible_path ( tmp ) ;
if ( ( fp = fopen ( tmp , " rb+ " ) ) ! = 0 )
{
//printf("delete(%s)\n",fname);
if ( scrubflag ! = 0 )
{
fseek ( fp , 0 , SEEK_END ) ;
fpos = ftell ( fp ) ;
rewind ( fp ) ;
for ( i = 0 ; i < fpos ; i + + )
fputc ( 0xff , fp ) ;
fflush ( fp ) ;
}
fclose ( fp ) ;
if ( ( fp = fopen ( tmp , " wb " ) ) ! = 0 )
fclose ( fp ) ;
return ( OS_portable_removefile ( fname ) ) ;
}
return ( 0 ) ;
}
void OS_remove_directory ( char * dirname )
{
FILE * fp ; char buf [ 1024 ] ;
sprintf ( buf , " %s/.tmpmarker " , dirname ) ;
if ( ( fp = fopen ( OS_compatible_path ( buf ) , " rb " ) ) ! = 0 )
{
OS_removefile ( buf , 0 ) ;
fclose ( fp ) ;
}
//printf("skip rmdir.(%s)\n",dirname);
return ;
sprintf ( buf , " rmdir %s " , dirname ) ;
if ( system ( buf ) ! = 0 )
{
//printf("error doing (%s)\n",buf);
sprintf ( buf , " rm -rf %s " , dirname ) ;
if ( system ( buf ) ! = 0 )
{
//printf("error doing (%s)\n",buf);
}
}
}
void OS_ensure_directory ( char * dirname )
{
FILE * fp ; int32_t retval ; char fname [ 512 ] ;
if ( 0 & & OS_removefile ( dirname , 0 ) < 0 )
{
sprintf ( fname , " tmp/%d " , rand ( ) ) ;
OS_renamefile ( dirname , fname ) ;
}
sprintf ( fname , " %s/.tmpmarker " , dirname ) ;
if ( ( fp = fopen ( OS_compatible_path ( fname ) , " rb " ) ) = = 0 )
{
if ( ( fp = fopen ( OS_compatible_path ( dirname ) , " rb " ) ) = = 0 )
{
retval = mkdir ( dirname
# ifndef _WIN32
, 511
# endif
) ;
//printf("mkdir.(%s) retval.%d errno.%d %s\n",dirname,retval,errno,strerror(errno));
} else fclose ( fp ) ; //, printf("dirname.(%s) exists\n",dirname);
if ( ( fp = fopen ( fname , " wb " ) ) ! = 0 )
fclose ( fp ) ; //, printf("created.(%s)\n",fname);
else printf ( " cant create.(%s) errno . % d % s \ n " ,fname,errno,strerror(errno)) ;
} else fclose ( fp ) ; //, printf("%s exists\n",fname);
}
unsigned long OS_filesize ( char * fname )
{
FILE * fp ; unsigned long fsize = 0 ;
if ( ( fp = fopen ( fname , " rb " ) ) ! = 0 )
{
fseek ( fp , 0 , SEEK_END ) ;
fsize = ftell ( fp ) ;
fclose ( fp ) ;
}
return ( fsize ) ;
}
int32_t OS_compare_files ( char * fname , char * fname2 )
{
int32_t offset , errs = 0 ;
long len , len2 ;
char buf [ 8192 ] , buf2 [ 8192 ] ;
FILE * fp , * fp2 ;
if ( ( fp = fopen ( OS_compatible_path ( fname ) , " rb " ) ) ! = 0 )
{
if ( ( fp2 = fopen ( OS_compatible_path ( fname2 ) , " rb " ) ) ! = 0 )
{
while ( ( len = fread ( buf , 1 , sizeof ( buf ) , fp ) ) > 0 & & ( len2 = fread ( buf2 , 1 , sizeof ( buf2 ) , fp2 ) ) = = len )
if ( ( offset = memcmp ( buf , buf2 , len ) ) ! = 0 )
printf ( " compare error at offset.%d: (%s) src.%ld vs. (%s) dest.%ld \n " , offset , fname , ftell ( fp ) , fname2 , ftell ( fp2 ) ) , errs + + ;
fclose ( fp2 ) ;
}
fclose ( fp ) ;
}
return ( errs ) ;
}
int64_t OS_copyfile ( char * src , char * dest , int32_t cmpflag )
{
int64_t allocsize , len = - 1 ;
char * buf ;
FILE * srcfp , * destfp ;
if ( ( srcfp = fopen ( OS_compatible_path ( src ) , " rb " ) ) ! = 0 )
{
if ( ( destfp = fopen ( OS_compatible_path ( dest ) , " wb " ) ) ! = 0 )
{
allocsize = 1024 * 1024 * 128L ;
buf = mycalloc ( ' F ' , 1 , allocsize ) ;
while ( ( len = fread ( buf , 1 , allocsize , srcfp ) ) > 0 )
if ( ( long ) fwrite ( buf , 1 , len , destfp ) ! = len )
printf ( " write error at (%s) src.%ld vs. (%s) dest.%ld \n " , src , ftell ( srcfp ) , dest , ftell ( destfp ) ) ;
len = ftell ( destfp ) ;
fclose ( destfp ) ;
myfree ( buf , allocsize ) ;
}
fclose ( srcfp ) ;
}
if ( len < 0 | | ( cmpflag ! = 0 & & OS_compare_files ( src , dest ) ! = 0 ) )
printf ( " Error copying files (%s) -> (%s) \n " , src , dest ) , len = - 1 ;
return ( len ) ;
}
int32_t OS_releasemap ( void * ptr , unsigned long filesize )
{
int32_t retval ;
if ( ptr = = 0 )
{
printf ( " release_map_file: null ptr \n " ) ;
return ( - 1 ) ;
}
retval = munmap ( ptr , filesize ) ;
if ( retval ! = 0 )
printf ( " release_map_file: munmap error %p %llu: err %d \n " , ptr , ( long long ) filesize , retval ) ;
return ( retval ) ;
}
void _OS_closemap ( struct OS_mappedptr * mp )
{
if ( mp - > actually_allocated ! = 0 & & mp - > fileptr ! = 0 )
myaligned_free ( mp - > fileptr , mp - > allocsize ) ;
else if ( mp - > fileptr ! = 0 )
OS_releasemap ( mp - > fileptr , mp - > allocsize ) ;
mp - > fileptr = 0 ;
mp - > closetime = ( uint32_t ) time ( NULL ) ;
mp - > opentime = 0 ;
}
void OS_closemap ( struct OS_mappedptr * mp )
{
struct OS_mappedptr tmp ;
tmp = * mp ;
_OS_closemap ( mp ) ;
memset ( mp , 0 , sizeof ( * mp ) ) ;
mp - > actually_allocated = tmp . actually_allocated ;
mp - > allocsize = tmp . allocsize ;
mp - > rwflag = tmp . rwflag ;
strcpy ( mp - > fname , tmp . fname ) ;
}
long OS_ensurefilesize ( char * fname , long filesize , int32_t truncateflag )
{
FILE * fp ;
char * zeroes ;
long i , n , allocsize = 0 ;
//printf("ensure_filesize.(%s) %ld %s | ",fname,filesize,mbstr(filesize));
if ( ( fp = fopen ( OS_compatible_path ( fname ) , " rb " ) ) ! = 0 )
{
fseek ( fp , 0 , SEEK_END ) ;
allocsize = ftell ( fp ) ;
fclose ( fp ) ;
//printf("(%s) exists size.%ld\n",fname,allocsize);
}
else
{
//printf("try to create.(%s)\n",fname);
if ( ( fp = fopen ( OS_compatible_path ( fname ) , " wb " ) ) ! = 0 )
fclose ( fp ) ;
}
if ( allocsize < filesize )
{
//printf("filesize.%ld is less than %ld\n",filesize,allocsize);
if ( ( fp = fopen ( OS_compatible_path ( fname ) , " ab " ) ) ! = 0 )
{
zeroes = myaligned_alloc ( 16L * 1024 * 1024 ) ;
memset ( zeroes , 0 , 16 * 1024 * 1024 ) ;
n = filesize - allocsize ;
while ( n > 16 * 1024 * 1024 )
{
fwrite ( zeroes , 1 , 16 * 1024 * 1024 , fp ) ;
n - = 16 * 1024 * 1024 ;
fprintf ( stderr , " + " ) ;
}
for ( i = 0 ; i < n ; i + + )
fputc ( 0 , fp ) ;
fclose ( fp ) ;
myaligned_free ( zeroes , 16L * 1024 * 1024 ) ;
}
return ( filesize ) ;
}
else if ( allocsize * truncateflag > filesize )
{
OS_truncate ( fname , filesize ) ;
return ( filesize ) ;
}
else return ( allocsize ) ;
}
int32_t OS_openmap ( struct OS_mappedptr * mp )
{
unsigned long allocsize = mp - > allocsize ;
if ( mp - > actually_allocated ! = 0 )
{
if ( mp - > fileptr = = 0 )
mp - > fileptr = myaligned_alloc ( mp - > allocsize ) ;
else memset ( mp - > fileptr , 0 , mp - > allocsize ) ;
return ( 0 ) ;
}
else
{
if ( mp - > fileptr ! = 0 )
{
//printf("opening already open mappedptr, pending %p\n",mp->pending);
OS_closemap ( mp ) ;
}
mp - > allocsize = allocsize ;
// printf("calling map_file with expected %ld\n",mp->allocsize);
mp - > fileptr = OS_mapfile ( mp - > fname , & mp - > allocsize , mp - > rwflag ) ;
if ( mp - > fileptr = = 0 | | mp - > allocsize ! = allocsize )
{
//printf("error mapping(%s) ptr %p mapped %ld vs allocsize %ld\n",mp->fname,mp->fileptr,mp->allocsize,allocsize);
return ( - 1 ) ;
}
mp - > closetime = 0 ;
mp - > opentime = ( uint32_t ) time ( NULL ) ;
}
return ( 0 ) ;
}
void * OS_mappedptr ( void * * ptrp , struct OS_mappedptr * mp , unsigned long allocsize , int32_t rwflag , char * fname )
{
unsigned long filesize ;
mp - > actually_allocated = 0 ; //!os_supports_mappedfiles();
if ( fname ! = 0 )
{
if ( strcmp ( mp - > fname , fname ) = = 0 )
{
if ( mp - > fileptr ! = 0 )
{
OS_releasemap ( mp - > fileptr , mp - > allocsize ) ;
mp - > fileptr = 0 ;
}
OS_openmap ( mp ) ;
if ( ptrp ! = 0 )
( * ptrp ) = mp - > fileptr ;
return ( mp - > fileptr ) ;
}
strcpy ( mp - > fname , fname ) ;
}
else mp - > actually_allocated = 1 ;
mp - > rwflag = rwflag ;
mp - > allocsize = allocsize ;
if ( rwflag ! = 0 & & mp - > actually_allocated = = 0 & & allocsize ! = 0 )
allocsize = OS_ensurefilesize ( fname , allocsize , 0 ) ;
if ( OS_openmap ( mp ) ! = 0 )
{
char str [ 65 ] ;
//printf("init_mappedptr %s.rwflag.%d | ",fname,rwflag);
if ( allocsize ! = 0 )
printf ( " error mapping(%s) rwflag.%d ptr %p mapped %llu vs allocsize %llu %s \n " , fname , rwflag , mp - > fileptr , ( long long ) mp - > allocsize , ( long long ) allocsize , mbstr ( str , allocsize ) ) ;
else allocsize = mp - > allocsize ;
if ( rwflag ! = 0 & & allocsize ! = mp - > allocsize )
{
filesize = mp - > allocsize ;
if ( mp - > fileptr ! = 0 )
OS_releasemap ( mp - > fileptr , mp - > allocsize ) ;
mp - > allocsize = allocsize ;
mp - > changedsize = ( allocsize - filesize ) ;
OS_openmap ( mp ) ;
if ( mp - > fileptr = = 0 | | mp - > allocsize ! = allocsize )
{
printf ( " SECOND error mapping(%s) ptr %p mapped %llu vs allocsize %llu \n " , fname , mp - > fileptr , ( long long ) mp - > allocsize , ( long long ) allocsize ) ;
exit ( - 1 ) ;
}
}
}
if ( ptrp ! = 0 )
( * ptrp ) = mp - > fileptr ;
return ( mp - > fileptr ) ;
}
void * OS_filealloc ( struct OS_mappedptr * M , char * fname , struct OS_memspace * mem , long size )
{
//printf("mem->used %ld size.%ld | size.%ld\n",mem->used,size,mem->size);
//printf("filemalloc.(%s) new space.%ld %s\n",fname,mem->size,mbstr(size));
memset ( M , 0 , sizeof ( * M ) ) ;
mem - > totalsize = size ;
if ( OS_mappedptr ( 0 , M , mem - > totalsize , 1 , fname ) = = 0 )
{
printf ( " couldnt create mapped file.(%s) \n " , fname ) ;
exit ( - 1 ) ;
}
mem - > ptr = M - > fileptr ;
mem - > used = 0 ;
return ( M - > fileptr ) ;
}
void * OS_loadfile ( char * fname , char * * bufp , long * lenp , long * allocsizep )
{
FILE * fp ;
long filesize , buflen = * allocsizep ;
char * buf = * bufp ;
* lenp = 0 ;
if ( ( fp = fopen ( OS_compatible_path ( fname ) , " rb " ) ) ! = 0 )
{
fseek ( fp , 0 , SEEK_END ) ;
filesize = ftell ( fp ) ;
if ( filesize = = 0 )
{
fclose ( fp ) ;
* lenp = 0 ;
printf ( " OS_loadfile null size.(%s) \n " , fname ) ;
return ( 0 ) ;
}
if ( filesize > buflen - 1 )
{
* allocsizep = filesize + 1 ;
* bufp = buf = realloc ( buf , ( long ) * allocsizep ) ;
}
rewind ( fp ) ;
if ( buf = = 0 )
printf ( " Null buf ??? \n " ) ;
else
{
if ( fread ( buf , 1 , ( long ) filesize , fp ) ! = ( unsigned long ) filesize )
printf ( " error reading filesize.%ld \n " , ( long ) filesize ) ;
buf [ filesize ] = 0 ;
}
fclose ( fp ) ;
* lenp = filesize ;
//printf("loaded.(%s)\n",buf);
} //else printf("OS_loadfile couldnt load.(%s)\n",fname);
return ( buf ) ;
}
void * OS_filestr ( long * allocsizep , char * fname )
{
long filesize = 0 ; char * buf = 0 ;
* allocsizep = 0 ;
return ( OS_loadfile ( fname , & buf , & filesize , allocsizep ) ) ;
}
// following functions cant be fully implemented in one or more OS
void * OS_mapfile ( char * fname , long * filesizep , int32_t enablewrite ) // win and pnacl dont have mmap64
{
return ( OS_portable_mapfile ( fname , filesizep , enablewrite ) ) ;
}
/*int32_t OS_syncmap(struct OS_mappedptr *mp,long len) // pnacl doesnt implement sync
{
return ( OS_portable_syncmap ( mp , len ) ) ;
}
void * OS_tmpalloc ( char * dirname , char * name , struct OS_memspace * mem , long origsize ) // no syncmap no tmpalloc
{
return ( OS_portable_tmpalloc ( dirname , name , mem , origsize ) ) ;
} */
void OS_init ( )
{
extern bits256 GENESIS_PUBKEY , GENESIS_PRIVKEY ;
tai_now ( ) ;
decode_hex ( GENESIS_PUBKEY . bytes , sizeof ( GENESIS_PUBKEY ) , GENESIS_PUBKEYSTR ) ;
decode_hex ( GENESIS_PRIVKEY . bytes , sizeof ( GENESIS_PRIVKEY ) , GENESIS_PRIVKEYSTR ) ;
SaM_PrepareIndices ( ) ;
OS_portable_init ( ) ;
}
int32_t OS_getline ( int32_t waitflag , char * line , int32_t max , char * dispstr )
{
if ( dispstr ! = 0 & & dispstr [ 0 ] ! = 0 )
fprintf ( stderr , " %s " , dispstr ) ;
line [ 0 ] = 0 ;
# ifndef _WIN32
if ( waitflag = = 0 )
{
static char prevline [ 1024 ] ;
struct timeval timeout ;
fd_set fdset ;
int32_t s ;
line [ 0 ] = 0 ;
FD_ZERO ( & fdset ) ;
FD_SET ( STDIN_FILENO , & fdset ) ;
timeout . tv_sec = 0 , timeout . tv_usec = 10000 ;
if ( ( s = select ( 1 , & fdset , NULL , NULL , & timeout ) ) < 0 )
fprintf ( stderr , " wait_for_input: error select s.%d \n " , s ) ;
else
{
if ( FD_ISSET ( STDIN_FILENO , & fdset ) > 0 & & fgets ( line , max , stdin ) = = line )
{
line [ strlen ( line ) - 1 ] = 0 ;
if ( line [ 0 ] = = 0 | | ( line [ 0 ] = = ' . ' & & line [ 1 ] = = 0 ) )
strcpy ( line , prevline ) ;
else strcpy ( prevline , line ) ;
}
}
return ( ( int32_t ) strlen ( line ) ) ;
}
# endif
if ( fgets ( line , max , stdin ) ! = 0 )
line [ strlen ( line ) - 1 ] = 0 ;
return ( ( int32_t ) strlen ( line ) ) ;
}
//////////// test suite for:
/*
int64_t OS_filesize ( char * fname ) ;
void OS_ensure_directory ( char * dirname ) ;
long OS_ensurefilesize ( char * fname , long filesize , int32_t truncateflag ) ;
int32_t OS_truncate ( char * fname , long filesize ) ;
int32_t OS_renamefile ( char * fname , char * newfname ) ;
int32_t OS_removefile ( char * fname , int32_t scrubflag ) ;
void * OS_mapfile ( char * fname , long * filesizep , int32_t enablewrite ) ;
int32_t OS_releasemap ( void * ptr , uint64_t filesize ) ;
double OS_milliseconds ( ) ;
void OS_randombytes ( uint8_t * x , long xlen ) ;
*/
int32_t iguana_OStests ( )
{
static uint16_t pairs [ 0x100 ] [ 0x100 ] , mappairs [ 0x100 ] [ 0x100 ] ;
uint8_t buf [ 4096 ] , * bufptr ; int32_t val , min , minij , maxij , max , i , j , histo [ 0x100 ] , retval = 0 , n = 0 ; double startmilli , endmilli ; FILE * fp ; char * name , * name2 , * dirname ; long filesize ; void * fileptr ;
startmilli = OS_milliseconds ( ) ;
printf ( " \n >>>>>>>>>> starting tests. Please count the seconds (or use stopwatch) \n " ) ;
name = " OStests " ;
name2 = " OStests2 " ;
dirname = " tmp " ;
fp = fopen ( name , " wb " ) ;
memset ( histo , 0 , sizeof ( histo ) ) ;
memset ( pairs , 0 , sizeof ( pairs ) ) ;
memset ( mappairs , 0 , sizeof ( mappairs ) ) ;
for ( i = 0 ; i < 4096 ; i + + )
{
OS_randombytes ( buf , sizeof ( buf ) ) ;
for ( j = 0 ; j < sizeof ( buf ) ; j + + )
{
if ( ( n + + % 100000 ) = = 0 )
printf ( " %02x " , buf [ j ] ) ;
if ( fp ! = 0 )
fputc ( buf [ j ] , fp ) ;
histo [ buf [ j ] ] + + ;
if ( j > 0 )
pairs [ buf [ j - 1 ] ] [ buf [ j ] ] + + ;
}
}
fclose ( fp ) ;
printf ( " \n end of random bytes \n \n " ) ;
if ( OS_filesize ( name ) ! = n )
printf ( " FAIL OS_filesize %lld != %d error and if OS_filesize doesnt work, nothing else will work \n " , ( long long ) OS_filesize ( name ) , n ) , retval - - ;
else
{
printf ( " PASS OS_filesize.(%s) matches %d \n " , name , n ) ;
OS_renamefile ( name , name2 ) ;
if ( OS_filesize ( name2 ) ! = n )
printf ( " FAIL OS_renamefile returns filesize %lld != %d \n " , ( long long ) OS_filesize ( name2 ) , n ) , retval - - ;
else printf ( " PASS OS_renamefile (%s) - > ( % s ) worked \ n " ,name,name2) ;
if ( ( fileptr = OS_mapfile ( name2 , & filesize , 0 ) ) = = 0 )
printf ( " FAIL OS_mapfile.(%s) returns null \n " , name2 ) , retval - - ;
else if ( filesize ! = n )
printf ( " FAIL OS_mapfile.(%s) returns %ld != %d \n " , name2 , filesize , n ) , retval - - ;
else
{
bufptr = fileptr ;
for ( i = 0 ; i < 4096 ; i + + )
{
memcpy ( buf , bufptr , sizeof ( buf ) ) ;
bufptr + = sizeof ( buf ) ;
for ( j = 1 ; j < sizeof ( buf ) ; j + + )
mappairs [ buf [ j - 1 ] ] [ buf [ j ] ] + + ;
}
if ( memcmp ( pairs , mappairs , sizeof ( pairs ) ) ! = 0 )
printf ( " FAIL OS_mapfile.(%s) %ld data error pairs[][] != mappairs[][] \n " , name2 , filesize ) , retval - - ;
else printf ( " PASS OS_mapfile.(%s) % ld regenerated identical pairs [ ] [ ] \ n " ,name2,filesize) ;
if ( OS_releasemap ( fileptr , filesize ) ! = 0 )
printf ( " FAIL OS_releasemap.(%s) %ld returns error \n " , name2 , filesize ) , retval - - ;
else printf ( " PASS OS_releasemap.(%s) % ld returns success \ n " ,name2,filesize) ;
}
OS_removefile ( name2 , 0 ) ;
if ( OS_filesize ( name2 ) = = n )
printf ( " FAIL OS_removefile.(%s) didnt work \n " , name2 ) , retval - - ;
else if ( ( fp = fopen ( name2 , " rb " ) ) ! = 0 )
printf ( " FAIL OS_removefile.(%s) didnt work fopen fp.%p \n " , name2 , fp ) , fclose ( fp ) , retval - - ;
else printf ( " PASS OS_removefile.(%s) worked \ n " ,name2) ;
}
minij = min = ( 1 < < 30 ) ;
maxij = max = - 1 ;
for ( i = 0 ; i < 0x100 ; i + + )
{
if ( ( val = histo [ i ] ) > max )
max = val ;
else if ( val < min )
min = val ;
for ( j = 0 ; j < 0x100 ; j + + )
{
if ( ( val = pairs [ i ] [ j ] ) > maxij )
maxij = val ;
else if ( val < minij )
minij = val ;
}
}
endmilli = OS_milliseconds ( ) ;
printf ( " \n \n Did that take %.3f seconds? If not, there is a problem with OS_milliseconds \n \n Make sure above numbers look random and the min/max are within specified range: \n <3%% %.2f%% min %d max %d | <75%% %.3f%% minij %d maxij %d \n " , ( endmilli - startmilli ) / 1000. , 100 * ( double ) max / min - 100. , min , max , 100 * ( double ) maxij / minij - 100. , minij , maxij ) ;
return ( retval ) ;
}