2005-08-10 18:54:14 +04:00
/*
2008-09-10 04:40:42 +04:00
* Copyright ( C ) 2004 - 2008 Kay Sievers < kay . sievers @ vrfy . org >
2005-08-10 18:54:14 +04:00
*
2008-09-10 04:40:42 +04:00
* This program is free software : you can redistribute it and / or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation , either version 2 of the License , or
* ( at your option ) any later version .
2005-08-10 18:54:14 +04:00
*
2008-09-10 04:40:42 +04:00
* This program is distributed in the hope that it will be useful ,
* but WITHOUT ANY WARRANTY ; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE . See the
* GNU General Public License for more details .
*
* You should have received a copy of the GNU General Public License
* along with this program . If not , see < http : //www.gnu.org/licenses/>.
2005-08-10 18:54:14 +04:00
*/
# include <stdlib.h>
# include <stdio.h>
# include <stddef.h>
# include <unistd.h>
2008-07-30 03:45:23 +04:00
# include <string.h>
2005-08-10 18:54:14 +04:00
# include <fcntl.h>
# include <errno.h>
# include <ctype.h>
# include <dirent.h>
# include <sys/stat.h>
# include <sys/mman.h>
# include "udev.h"
int file_map ( const char * filename , char * * buf , size_t * bufsize )
{
struct stat stats ;
int fd ;
fd = open ( filename , O_RDONLY ) ;
if ( fd < 0 ) {
return - 1 ;
}
if ( fstat ( fd , & stats ) < 0 ) {
close ( fd ) ;
return - 1 ;
}
* buf = mmap ( NULL , stats . st_size , PROT_READ , MAP_SHARED , fd , 0 ) ;
if ( * buf = = MAP_FAILED ) {
close ( fd ) ;
return - 1 ;
}
* bufsize = stats . st_size ;
close ( fd ) ;
return 0 ;
}
void file_unmap ( void * buf , size_t bufsize )
{
munmap ( buf , bufsize ) ;
}
/* return number of chars until the next newline, skip escaped newline */
size_t buf_get_line ( const char * buf , size_t buflen , size_t cur )
{
int escape = 0 ;
size_t count ;
for ( count = cur ; count < buflen ; count + + ) {
if ( ! escape & & buf [ count ] = = ' \n ' )
break ;
if ( buf [ count ] = = ' \\ ' )
escape = 1 ;
else
escape = 0 ;
}
return count - cur ;
}