space -> tab

No object change.

1 files changed, 7 insertions, 7 deletions

diff --git a/sbin/isakmpd/ipsec.c b/sbin/isakmpd/ipsec.c
index 855462e09bb..92bb178488a 100644
--- a/sbin/isakmpd/ipsec.c
+++ b/sbin/isakmpd/ipsec.c
@@ -1,4 +1,4 @@
-/* $OpenBSD: ipsec.c,v 1.148 2017/10/27 08:29:32 mpi Exp $	 */
+/* $OpenBSD: ipsec.c,v 1.149 2018/01/04 14:21:00 mpi Exp $	 */
 /* $EOM: ipsec.c,v 1.143 2000/12/11 23:57:42 niklas Exp $	 */
 
 /*
@@ -832,7 +832,7 @@ ipsec_get_keystate(struct message *msg)
 	 * For phase 2 when no SA yet is setup we need to hash the IV used by
 	 * the ISAKMP SA concatenated with the message ID, and use that as an
 	 * IV for further cryptographic operations.
-         */
+ 	*/
 	if (!msg->isakmp_sa->keystate) {
 		log_print("ipsec_get_keystate: no keystate in ISAKMP SA %p",
 		    msg->isakmp_sa);
@@ -1206,7 +1206,7 @@ ipsec_responder(struct message *msg)
 	/*
 	 * XXX So far we don't accept any proposals for exchanges we don't
 	 * support.
-         */
+ 	*/
 	if (payload_first(msg, ISAKMP_PAYLOAD_SA)) {
 		message_drop(msg, ISAKMP_NOTIFY_NO_PROPOSAL_CHOSEN, 0, 1, 0);
 		return -1;
@@ -1560,7 +1560,7 @@ ipsec_decode_transform(struct message *msg, struct sa *sa, struct proto *proto,
 	/*
 	 * If no pseudo-random function was negotiated, it's HMAC.
 	 * XXX As PRF_HMAC currently is zero, this is a no-op.
-         */
+ 	*/
 	if (!ie->prf_type)
 		ie->prf_type = PRF_HMAC;
 }
@@ -2348,7 +2348,7 @@ ipsec_add_contact(struct message *msg)
 	/*
 	 * XXX There are better algorithms for already mostly-sorted data like
 	 * this, but only qsort is standard.  I will someday do this inline.
-         */
+ 	*/
 	qsort(contacts, contact_cnt, sizeof *contacts, addr_cmp);
 	return 0;
 }
@@ -2521,7 +2521,7 @@ ipsec_id_string(u_int8_t *id, size_t id_len)
 	 * XXX Real ugly way of making the offsets correct.  Be aware that id
 	 * now will point before the actual buffer and cannot be dereferenced
 	 * without an offset larger than or equal to ISAKM_GEN_SZ.
-         */
+ 	*/
 	id -= ISAKMP_GEN_SZ;
 
 	/* This is the actual length of the ID data field.  */
@@ -2531,7 +2531,7 @@ ipsec_id_string(u_int8_t *id, size_t id_len)
 	 * Conservative allocation.
 	 * XXX I think the ASN1 DN case can be thought through to give a better
 	 * estimate.
-         */
+ 	*/
 	size = MAXIMUM(sizeof "ipv6/ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff",
 	    sizeof "asn1_dn/" + id_len);
 	buf = malloc(size);