aboutsummaryrefslogtreecommitdiffstats
path: root/src/routines.c
diff options
context:
space:
mode:
authorJoursoir <chat@joursoir.net>2022-08-31 18:20:00 +0300
committerJoursoir <chat@joursoir.net>2022-08-31 19:14:03 +0300
commite2ded11868b5dc07a3f8f1aab1e6976fb22c6bee (patch)
tree1263874d5debf94294b75ba365f1aa6068e239d6 /src/routines.c
parent471a67cd6bb133267e9e26ee0c4a6a934299253f (diff)
downloadlock-password-e2ded11868b5dc07a3f8f1aab1e6976fb22c6bee.tar.gz
lock-password-e2ded11868b5dc07a3f8f1aab1e6976fb22c6bee.tar.bz2
lock-password-e2ded11868b5dc07a3f8f1aab1e6976fb22c6bee.zip
tree: handle a pointer returned by malloc()
It is wrong to assume that malloc() always returns allocated memory. Unfortunately, it can return NULL. The rest of the code that uses malloc() should be refactored. That's the reason why we can't do it right now.
Diffstat (limited to 'src/routines.c')
-rw-r--r--src/routines.c16
1 files changed, 15 insertions, 1 deletions
diff --git a/src/routines.c b/src/routines.c
index 2250fec..da83c38 100644
--- a/src/routines.c
+++ b/src/routines.c
@@ -99,6 +99,12 @@ char *get_pubkey()
}
pubkey = malloc(sizeof(char) * (maxlen_fingerprint + 1));
+ if (!pubkey) {
+ print_error("Unable to allocate space for the public key.\n");
+ fclose(fileGPG);
+ return NULL;
+ }
+
if(fgets(pubkey, maxlen_fingerprint + 1, fileGPG) == NULL) {
print_error("Error: %s\n", strerror(errno));
free(pubkey);
@@ -159,8 +165,12 @@ int insert_pass(const char *path, const char *password)
char *get_input(int minlen, int maxlen)
{
- char *pass = malloc(sizeof(char) * (maxlen + 1));
int len;
+ char *pass = malloc(sizeof(char) * (maxlen + 1));
+ if (!pass) {
+ print_error("Unable to allocate space for the password.\n");
+ return NULL;
+ }
if(fgets(pass, maxlen + 1, stdin) == NULL) {
print_error("Error: %s\n", strerror(errno));
@@ -189,6 +199,10 @@ char *gen_password(int length)
"0123456789"
"!@#$^&*?";
char *password = malloc(sizeof(char) * (length + 1));
+ if (!password) {
+ print_error("Unable to allocate space for the password.\n");
+ return NULL;
+ }
srand(time(NULL));
for(i = 0; i < length; i++)