74 lines
1.7 KiB
C
74 lines
1.7 KiB
C
|
/* ************************************************************************** */
|
||
|
|
/* */
|
||
|
|
/* ::: :::::::: */
|
||
|
|
/* get_next_line_utils.c :+: :+: :+: */
|
||
|
|
/* +:+ +:+ +:+ */
|
||
|
|
/* By: adjoly <adjoly@student.42.fr> +#+ +:+ +#+ */
|
||
|
|
/* +#+#+#+#+#+ +#+ */
|
||
|
|
/* Created: 2023/11/24 11:51:43 by madumerg #+# #+# */
|
||
|
|
/* Updated: 2023/12/08 17:21:26 by adjoly ### ########.fr */
|
||
|
|
/* */
|
||
|
|
/* ************************************************************************** */
|
||
|
|
|
||
|
|
#include "get_next_line.h"
|
||
|
|
|
||
|
|
size_t ft_strlen(char *str)
|
||
|
|
{
|
||
|
|
size_t i;
|
||
|
|
|
||
|
|
i = 0;
|
||
|
|
while (str[i])
|
||
|
|
i++;
|
||
|
|
return (i);
|
||
|
|
}
|
||
|
|
|
||
|
|
char *ft_strjoin(char *s1, char *s2)
|
||
|
|
{
|
||
|
|
size_t len;
|
||
|
|
size_t i;
|
||
|
|
size_t j;
|
||
|
|
char *str;
|
||
|
|
|
||
|
|
if (!s2)
|
||
|
|
return (NULL);
|
||
|
|
len = ft_strlen(s1) + ft_strlen(s2);
|
||
|
|
str = malloc(sizeof(char) * (len + 1));
|
||
|
|
if (!str)
|
||
|
|
return (NULL);
|
||
|
|
i = 0;
|
||
|
|
while (s1[i] != '\0')
|
||
|
|
{
|
||
|
|
str[i] = s1[i];
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
j = 0;
|
||
|
|
while (s2[j] != '\0')
|
||
|
|
str[i++] = s2[j++];
|
||
|
|
free(s1);
|
||
|
|
str[i] = '\0';
|
||
|
|
return (str);
|
||
|
|
}
|
||
|
|
|
||
|
|
void *ft_calloc(size_t ct, size_t size)
|
||
|
|
{
|
||
|
|
char *str;
|
||
|
|
size_t i;
|
||
|
|
|
||
|
|
i = 0;
|
||
|
|
if (size == 0 || ct == 0)
|
||
|
|
return (malloc(1));
|
||
|
|
if ((int)size < 0 && (int)ct < 0)
|
||
|
|
return (NULL);
|
||
|
|
if ((unsigned long long)(size * ct) > 4294967295)
|
||
|
|
return (NULL);
|
||
|
|
str = malloc(size * ct);
|
||
|
|
if (!str)
|
||
|
|
return (NULL);
|
||
|
|
while (i < (ct * size))
|
||
|
|
{
|
||
|
|
*(unsigned char *)(str + i) = '\0';
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return (str);
|
||
|
|
}
|