mirror of
https://github.com/status-im/status-go.git
synced 2025-01-17 02:02:36 +00:00
e65760ca85
This commit adds basic syncing capabilities with peers if they are both online. It updates the work done on MVDS, but I decided to create the code in status-go instead, since it's very tight to the application (similarly the code that was the inspiration for mvds, bramble, is all tight together at the database level). I reused parts of the protobufs. The flow is: 1) An OFFER message is sent periodically with a bunch of message-ids and group-ids. 2) Anyone can REQUEST some of those messages if not present in their database. 3) The peer will then send over those messages. It's disabled by default, but I am planning to add a way to set up the flags.
36 lines
755 B
C
36 lines
755 B
C
#ifndef _SYS_PARAM_H
|
|
#define _SYS_PARAM_H
|
|
|
|
#define MAXSYMLINKS 20
|
|
#define MAXHOSTNAMELEN 64
|
|
#define MAXNAMLEN 255
|
|
#define MAXPATHLEN 4096
|
|
#define NBBY 8
|
|
#define NGROUPS 32
|
|
#define CANBSIZ 255
|
|
#define NOFILE 256
|
|
#define NCARGS 131072
|
|
#define DEV_BSIZE 512
|
|
#define NOGROUP (-1)
|
|
|
|
#undef MIN
|
|
#undef MAX
|
|
#define MIN(a,b) (((a)<(b))?(a):(b))
|
|
#define MAX(a,b) (((a)>(b))?(a):(b))
|
|
|
|
#define __bitop(x,i,o) ((x)[(i)/8] o (1<<(i)%8))
|
|
#define setbit(x,i) __bitop(x,i,|=)
|
|
#define clrbit(x,i) __bitop(x,i,&=~)
|
|
#define isset(x,i) __bitop(x,i,&)
|
|
#define isclr(x,i) !isset(x,i)
|
|
|
|
#define howmany(n,d) (((n)+((d)-1))/(d))
|
|
#define roundup(n,d) (howmany(n,d)*(d))
|
|
#define powerof2(n) !(((n)-1) & (n))
|
|
|
|
#include <sys/resource.h>
|
|
#include <endian.h>
|
|
#include <limits.h>
|
|
|
|
#endif
|