freebsd-src/sbin/hastd
Sevan Janiyan 6b28082ba0 MFC r267667:
use .Mt to mark up email addresses consistently (part1)

PR:		191174
Submitted by:	Franco Fichtner  <franco at lastsummer.de>
2016-10-16 22:02:50 +00:00
..
activemap.c Spelling fixes for sbin/ 2012-01-07 16:09:33 +00:00
activemap.h
control.c MFC r257155, r257582, r259191, r259192, r259193, r259194, r259195, r259196: 2013-12-28 19:21:22 +00:00
control.h Rename HASTCTL_ defines, which are used for conversion between main 2011-04-26 19:38:30 +00:00
crc32.c Allow to checksum on-the-wire data using either CRC32 or SHA256. 2011-03-06 22:56:14 +00:00
crc32.h Allow to checksum on-the-wire data using either CRC32 or SHA256. 2011-03-06 22:56:14 +00:00
ebuf.c For functions that return -1 on failure check exactly for -1 and not for 2012-01-10 22:39:07 +00:00
ebuf.h
event.c For functions that return -1 on failure check exactly for -1 and not for 2012-01-10 22:39:07 +00:00
event.h
hast_checksum.c Simplify code by changing functions types from int to avoid, as the functions 2011-12-15 22:03:17 +00:00
hast_checksum.h Allow to checksum on-the-wire data using either CRC32 or SHA256. 2011-03-06 22:56:14 +00:00
hast_compression.c Spelling fixes for sbin/ 2012-01-07 16:09:33 +00:00
hast_compression.h Allow to compress on-the-wire data using two algorithms: 2011-03-06 23:09:33 +00:00
hast_proto.c - Add support for 'memsync' mode. This is the fastest replication mode that's 2013-02-17 21:12:34 +00:00
hast_proto.h Remove hast_proto_recv(). It was used only in one place, where 2011-04-17 16:18:45 +00:00
hast.conf.5 MFC r267667: 2016-10-16 22:02:50 +00:00
hast.h MFC r257155, r257582, r259191, r259192, r259193, r259194, r259195, r259196: 2013-12-28 19:21:22 +00:00
hastd.8 MFC r267667: 2016-10-16 22:02:50 +00:00
hastd.c MFC r257155, r257582, r259191, r259192, r259193, r259194, r259195, r259196: 2013-12-28 19:21:22 +00:00
hastd.h
hooks.c For functions that return -1 on failure check exactly for -1 and not for 2012-01-10 22:39:07 +00:00
hooks.h
lzf.c Allow to compress on-the-wire data using two algorithms: 2011-03-06 23:09:33 +00:00
lzf.h MFC r304969: 2016-08-31 18:37:04 +00:00
Makefile MFC r270433: 2014-09-01 03:22:47 +00:00
metadata.c For functions that return -1 on failure check exactly for -1 and not for 2012-01-10 22:39:07 +00:00
metadata.h
nv.c MFC r257155, r257582, r259191, r259192, r259193, r259194, r259195, r259196: 2013-12-28 19:21:22 +00:00
nv.h
parse.y Improve compatibility with old flex and fix build with GCC. 2013-05-22 17:47:45 +00:00
pjdlog.c Ensure that pjdlog functions don't modify errno. 2011-09-27 06:43:51 +00:00
pjdlog.h Revert r228695. We use __func__ here as a format to distinguish between 2012-11-05 00:38:14 +00:00
primary.c MFC r257155, r257582, r259191, r259192, r259193, r259194, r259195, r259196: 2013-12-28 19:21:22 +00:00
proto_common.c Check if there is cmsg at all. 2012-07-01 16:26:07 +00:00
proto_impl.h The proto API is a general purpose API, so don't use 'hast' in structures or 2011-03-22 16:21:11 +00:00
proto_socketpair.c For functions that return -1 on failure check exactly for -1 and not for 2012-01-10 22:39:07 +00:00
proto_tcp.c For functions that return -1 on failure check exactly for -1 and not for 2012-01-10 22:39:07 +00:00
proto_uds.c For functions that return -1 on failure check exactly for -1 and not for 2012-01-10 22:39:07 +00:00
proto.c MFC r257155, r257582, r259191, r259192, r259193, r259194, r259195, r259196: 2013-12-28 19:21:22 +00:00
proto.h In hast.conf we define the other node's address in 'remote' variable. 2011-03-21 08:54:59 +00:00
rangelock.c Nice range comparison. 2012-02-11 16:41:52 +00:00
rangelock.h
refcnt.h MFC 261517,261520: 2014-02-18 20:27:17 +00:00
secondary.c MFC r257155, r257582, r259191, r259192, r259193, r259194, r259195, r259196: 2013-12-28 19:21:22 +00:00
subr.c Merge an applicable subset of r263234 from HEAD to stable/10: 2015-03-19 12:32:48 +00:00
subr.h Constify argument. 2012-01-06 12:27:17 +00:00
synch.h Revert: r236909 2012-06-11 20:27:52 +00:00
token.l Improve compatibility with old flex and fix build with GCC. 2013-05-22 17:47:45 +00:00