146 lines
3.6 KiB
C
146 lines
3.6 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* get_next_line.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: hulamy <marvin@42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2019/12/21 00:28:33 by hulamy #+# #+# */
|
|
/* Updated: 2019/12/21 00:28:39 by hulamy ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "get_next_line_bonus.h"
|
|
|
|
/*
|
|
** //-g -fsanitize=address
|
|
** //:set noendofline binary
|
|
** //https://github.com/charMstr/GNL_lover
|
|
** //https://github.com/mrjvs/42cursus_gnl_tests
|
|
** //https://github.com/Sherchryst/gnlkiller
|
|
** //https://github.com/Hellio404/Get_Next_Line_Tester
|
|
** //https://github.com/TinfoilPancakes/get-next-line-testing-tools
|
|
**
|
|
** #include <stdio.h> //for printf
|
|
** #include <fcntl.h> //for open
|
|
**
|
|
** int main(int ac, char **av)
|
|
** {
|
|
** int *fd;
|
|
** int i;
|
|
** int j;
|
|
** int ret;
|
|
** char *line;
|
|
**
|
|
** // if (ac < 2)
|
|
** // return (0);
|
|
**
|
|
** // (void)i;(void)j;
|
|
** // line = NULL;
|
|
** // fd[0] = open(av[1], O_RDONLY);
|
|
** // ret = 1;
|
|
** // while (ret)
|
|
** // {
|
|
** // ret = get_next_line(fd[0], &line);
|
|
** // printf("[%i] %s\n", ret, line);
|
|
** // }
|
|
**
|
|
** line = NULL;
|
|
** i = 0;
|
|
** if (!(fd = (int *)malloc(sizeof(int) * ac)))
|
|
** return (0);
|
|
** while (++i <= ac - 1)
|
|
** fd[i - 1] = open(av[i], O_RDONLY);
|
|
** i = 0;
|
|
** j = 0;
|
|
** while (j < ac - 1)
|
|
** {
|
|
** if ((ret = get_next_line(fd[i], &line)) > 0)
|
|
** {
|
|
** printf("[fd%i-%i] %s\n", fd[i], ret, line);
|
|
** free(line);
|
|
** j = 0;
|
|
** }
|
|
** else
|
|
** {
|
|
** printf("[fd%i-%i]*FINI*\n", fd[i], ret);
|
|
** j++;
|
|
** }
|
|
** i++;
|
|
** if (i >= ac - 1)
|
|
** i = 0;
|
|
** }
|
|
** free (fd);
|
|
** //while (1);
|
|
** return (0);
|
|
** }
|
|
*/
|
|
|
|
int free_lst(t_gnlist **lst, const int fd, int ret)
|
|
{
|
|
t_gnlist *tmp;
|
|
|
|
tmp = *lst;
|
|
while ((*lst)->next && (*lst)->next->lfd != fd)
|
|
(*lst) = (*lst)->next;
|
|
free(tmp->string);
|
|
(*lst)->next = (*lst)->next->next;
|
|
free(tmp);
|
|
return (ret);
|
|
}
|
|
|
|
int multi_fd(int fd, t_gnlist **lst)
|
|
{
|
|
t_gnlist *tmp;
|
|
|
|
tmp = *lst;
|
|
while (*lst && (*lst)->lfd != fd && (*lst)->next != tmp)
|
|
*lst = (*lst)->next;
|
|
if (!tmp || ((*lst)->next == tmp && (*lst)->lfd != fd))
|
|
{
|
|
if (!(tmp = (t_gnlist*)malloc(sizeof(*tmp))))
|
|
return (0);
|
|
tmp->lfd = fd;
|
|
if (!(tmp->string = ft_strdup("")))
|
|
return (0);
|
|
if (*lst)
|
|
{
|
|
tmp->next = (*lst)->next;
|
|
(*lst)->next = tmp;
|
|
}
|
|
else
|
|
tmp->next = tmp;
|
|
*lst = tmp;
|
|
}
|
|
return (1);
|
|
}
|
|
|
|
int get_next_line(const int fd, char **line)
|
|
{
|
|
char buf[BUFFER_SIZE + 1];
|
|
int ret;
|
|
static t_gnlist *lst = NULL;
|
|
char *str;
|
|
|
|
ret = 1;
|
|
if (!(multi_fd(fd, &lst)) || !line || BUFFER_SIZE < 1)
|
|
return (free_lst(&lst, fd, -1));
|
|
while (!(str = ft_strchr(lst->string, '\n')) && ret != 0)
|
|
{
|
|
if ((ret = read(fd, buf, BUFFER_SIZE)) < 0)
|
|
return (free_lst(&lst, fd, -1));
|
|
buf[ret] = '\0';
|
|
if (!(lst->string = ft_strjoinfree(lst->string, buf)))
|
|
return (free_lst(&lst, fd, -1));
|
|
}
|
|
if (str != NULL)
|
|
{
|
|
str[0] = '\0';
|
|
if (!(*line = ft_strdup(lst->string)))
|
|
return (free_lst(&lst, fd, -1));
|
|
ft_memmove(lst->string, str + 1, ft_strlen(str + 1) + 1);
|
|
return (1);
|
|
}
|
|
return (free_lst(&lst, fd, 0));
|
|
}
|