Logo Search packages:      
Sourcecode: weborf version File versions  Download package


Copyright (C) 2009  Salvo "LtWorf" Tomaselli

Weborf 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 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
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/>.

@author Salvo "LtWorf" Tomaselli <tiposchi@tiscali.it>

#include "buffered_reader.h"
#include "options.h"
#include <unistd.h>
#include <stdlib.h>
#include <string.h>
#include <poll.h>

This funcion inits the struct allocating a buffer of the specified size.
It will return 0 on success and 1 on fail.
short int buffer_init(buffered_read_t * buf, ssize_t size) {
    buf->buffer = malloc(sizeof(char) * size);
    buf->size = size;
    return (buf->buffer == NULL) ? 1 : 0;

Resets the pointers, so the buffer is ready for new reads on new
file descriptor
void buffer_reset (buffered_read_t * buf) {
    buf->end = buf->start = buf->buffer;

This function will free the memory allocated by the buffer used in the struct.
void buffer_free(buffered_read_t * buf) {

This function is designed to be similar to a normal read, but it uses an internal
When the buffer is empty, it will try to fill it.
An important difference from the normal read is that this function will wait until
the requested amount of bytes are available, or until the timeout occurs.
Timeout duration is defined with the READ_TIMEOUT define.
On some special cases, the read data could be less than the requested one. For example if
end of file is reached and it is impossible to do further reads.
ssize_t buffer_read(int fd, void *b, ssize_t count, buffered_read_t * buf) {
    ssize_t wrote = 0;              //Count of written bytes
    ssize_t available, needed;      //Available bytes in buffer, and requested bytes remaining
    ssize_t r;

    while (wrote < count) {
        available = buf->end - buf->start;
        needed = count - wrote;

        if (needed <= available) { //More data in buffer than needed
            memcpy(b, buf->start, needed);
            buf->start += needed;
            return wrote + needed;
        } else { //Requesting more data than available
            if (available > 0) {//Empty the remaining data in the buffer
                memcpy(b, buf->start, available);
                b += available;
                wrote += available;
            //Filing the buffer again
            buf->start = buf->buffer;

                //Timeout implementation
                struct pollfd monitor[1];
                monitor[0].fd = fd; //File descriptor to monitor
                monitor[0].events = POLLIN; //Monitor on input events

                //Waits the timeout or reads the data.
                //If timeout is reached and no input is available
                //will behave like the stream is closed.
                if (poll(monitor, 1, READ_TIMEOUT) == 0) {
                    r = 0;
                } else {
                    r = read(fd, buf->buffer, buf->size);

            if (r <= 0) { //End of the stream
                buf->end = buf->start;
                return wrote;
            buf->end = buf->start + r;

    } /*while */
    return wrote;

/*#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>

int main () {
    buffered_read_t buf;

    buffer_init(&buf, 30);

    int fp=open("/home/salvo/.bash_history",O_RDONLY);
    char * k=malloc (600);

    int end=0;
    while ((end=buffer_read(fp,k,500,&buf))>=500 ) {

        printf("---- %s\n",k);


Generated by  Doxygen 1.6.0   Back to index