|
|
1.1 ! root 1: .\" Copyright (c) 1990 The Regents of the University of California. ! 2: .\" All rights reserved. ! 3: .\" ! 4: .\" This code is derived from software contributed to Berkeley by ! 5: .\" Chris Torek. ! 6: .\" ! 7: .\" Redistribution and use in source and binary forms are permitted provided ! 8: .\" that: (1) source distributions retain this entire copyright notice and ! 9: .\" comment, and (2) distributions including binaries display the following ! 10: .\" acknowledgement: ``This product includes software developed by the ! 11: .\" University of California, Berkeley and its contributors'' in the ! 12: .\" documentation or other materials provided with the distribution and in ! 13: .\" all advertising materials mentioning features or use of this software. ! 14: .\" Neither the name of the University nor the names of its contributors may ! 15: .\" be used to endorse or promote products derived from this software without ! 16: .\" specific prior written permission. ! 17: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED ! 18: .\" WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF ! 19: .\" MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 20: .\" ! 21: .\" @(#)bcmp.3 5.2 (Berkeley) 6/24/90 ! 22: .\" ! 23: .TH BCMP 3 "June 24, 1990" ! 24: .UC 7 ! 25: .SH NAME ! 26: bcmp \- compare byte string ! 27: .SH SYNOPSIS ! 28: .nf ! 29: .ft B ! 30: #include <string.h> ! 31: ! 32: int ! 33: bcmp(const char *b1, const char *b2, size_t len); ! 34: .ft R ! 35: .fi ! 36: .SH DESCRIPTION ! 37: .B Bcmp ! 38: compares byte string ! 39: .I b1 ! 40: against byte string ! 41: .IR b2 , ! 42: returning zero if they are identical, non-zero otherwise. ! 43: Both strings are assumed to be ! 44: .I len ! 45: bytes long. ! 46: Zero-length strings are always identical. ! 47: .PP ! 48: The strings may overlap. ! 49: .SH SEE ALSO ! 50: bcmp(3), memcmp(3), strcasecmp(3), strcmp(3), strcoll(3), strxfrm(3)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.