summaryrefslogtreecommitdiffstats
path: root/sbin/hastd/proto_uds.c
Commit message (Collapse)AuthorAgeFilesLines
* - Rename proto_descriptor_{send,recv}() functions topjd2011-02-021-32/+4
| | | | | | | | | | | proto_connection_{send,recv} and change them to return proto_conn structure. We don't operate directly on descriptors, but on proto_conns. - Add wrap method to wrap descriptor with proto_conn. - Remove methods to send and receive descriptors and implement this functionality as additional argument to send and receive methods. MFC after: 1 week
* Add proto_connect_wait() to wait for connection to finish.pjd2011-02-021-1/+16
| | | | | | | | | | | | | If timeout argument to proto_connect() is -1, then the caller needs to use this new function to wait for connection. This change is in preparation for capsicum, where sandboxed worker wants to ask main process to connect in worker's behalf and pass descriptor to the worker. Because we don't want the main process to wait for the connection, it will start async connection and pass descriptor to the worker who will be responsible for waiting for the connection to finish. MFC after: 1 week
* Allow to specify connection timeout by the caller.pjd2011-02-021-1/+2
| | | | MFC after: 1 week
* Implement two new functions for sending descriptor and receving descriptorpjd2011-01-311-0/+28
| | | | | | | over UNIX domain sockets and socket pairs. This is in preparation for capsicum. MFC after: 1 week
* - Use pjdlog for assertions and aborts as this will log assert/abort messagepjd2011-01-311-36/+26
| | | | | | | | | to syslog if we run in background. - Asserts in proto.c that method we want to call is implemented and remove dummy methods from protocols implementation that are only there to abort the program with nice message. MFC after: 1 week
* Assert that various buffers we are large enough.pjd2010-08-051-5/+6
| | | | MFC after: 1 month
* Add an argument to the proto_register() function which allows protocol topjd2010-08-051-1/+1
| | | | | | | declare it is the default and be placed at the end of the queue so it is checked last. MFC after: 1 month
* Please welcome HAST - Highly Avalable Storage.pjd2010-02-181-0/+330
HAST allows to transparently store data on two physically separated machines connected over the TCP/IP network. HAST works in Primary-Secondary (Master-Backup, Master-Slave) configuration, which means that only one of the cluster nodes can be active at any given time. Only Primary node is able to handle I/O requests to HAST-managed devices. Currently HAST is limited to two cluster nodes in total. HAST operates on block level - it provides disk-like devices in /dev/hast/ directory for use by file systems and/or applications. Working on block level makes it transparent for file systems and applications. There in no difference between using HAST-provided device and raw disk, partition, etc. All of them are just regular GEOM providers in FreeBSD. For more information please consult hastd(8), hastctl(8) and hast.conf(5) manual pages, as well as http://wiki.FreeBSD.org/HAST. Sponsored by: FreeBSD Foundation Sponsored by: OMCnet Internet Service GmbH Sponsored by: TransIP BV
OpenPOWER on IntegriCloud