memcpy is newer and better.
Index: kvm.c
===================================================================
RCS file: /cvs/src/lib/libkvm/kvm.c,v
retrieving revision 1.59
diff -u -p -r1.59 kvm.c
--- kvm.c 19 Dec 2015 18:40:30 -0000 1.59
+++ kvm.c 10 May 2016 22:46:07 -0000
@@ -713,7 +713,7 @@ kvm_dbopen(kvm_t *kd, const char *uf)
if (rec.data == 0 || rec.size > sizeof(dbversion))
goto close;
- bcopy(rec.data, dbversion, rec.size);
+ memcpy(dbversion, rec.data, rec.size);
dbversionlen = rec.size;
/*
@@ -727,7 +727,7 @@ kvm_dbopen(kvm_t *kd, const char *uf)
goto close;
if (rec.data == 0 || rec.size != sizeof(struct nlist))
goto close;
- bcopy(rec.data, &nitem, sizeof(nitem));
+ memcpy(&nitem, rec.data, sizeof(nitem));
if (kvm_read(kd, (u_long)nitem.n_value, kversion, dbversionlen) !=
dbversionlen)
goto close;
@@ -791,10 +791,10 @@ kvm_nlist(kvm_t *kd, struct nlist *nl)
/*
* Avoid alignment issues.
*/
- bcopy(&((struct nlist *)rec.data)->n_type,
- &p->n_type, sizeof(p->n_type));
- bcopy(&((struct nlist *)rec.data)->n_value,
- &p->n_value, sizeof(p->n_value));
+ memcpy(&p->n_type, &((struct nlist *)rec.data)->n_type,
+ sizeof(p->n_type));
+ memcpy(&p->n_value, &((struct nlist *)rec.data)->n_value,
+ sizeof(p->n_value));
}
/*
* Return the number of entries that weren't found.
Index: kvm_proc.c
===================================================================
RCS file: /cvs/src/lib/libkvm/kvm_proc.c,v
retrieving revision 1.52
diff -u -p -r1.52 kvm_proc.c
--- kvm_proc.c 22 Oct 2014 04:13:35 -0000 1.52
+++ kvm_proc.c 10 May 2016 22:47:07 -0000
@@ -490,7 +490,7 @@ kvm_ureadm(kvm_t *kd, const struct kinfo
return (0);
}
cc = (size_t)MIN(cnt, len);
- bcopy(dp, cp, cc);
+ memcpy(cp, dp, cc);
cp += cc;
uva += cc;
len -= cc;
