1 /*
2  * Copyright (c) 2021 Omar Polo <op@omarpolo.com>
3  *
4  * Permission to use, copy, modify, and distribute this software for any
5  * purpose with or without fee is hereby granted, provided that the above
6  * copyright notice and this permission notice appear in all copies.
7  *
8  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
15  */
16 
17 #include "compat.h"
18 
19 #include <ctype.h>
20 #include <errno.h>
21 #include <fcntl.h>
22 #include <stdlib.h>
23 #include <string.h>
24 #include <unistd.h>
25 
26 #include "telescope.h"
27 #include "utils.h"
28 
29 int
30 mark_nonblock(int fd)
31 {
32 	int flags;
33 
34 	if ((flags = fcntl(fd, F_GETFL)) == -1)
35 		return 0;
36 	if (fcntl(fd, F_SETFL, flags | O_NONBLOCK) == -1)
37 		return 0;
38 	return 1;
39 }
40 
41 int
42 has_prefix(const char *str, const char *prfx)
43 {
44 	size_t i;
45 
46 	for (i = 0; str[i] != '\0' && prfx[i] != '\0'; ++i)
47 		if (str[i] != prfx[i])
48 			return 0;
49 	return prfx[i] == '\0';
50 }
51 
52 int
53 has_suffix(const char *str, const char *sufx)
54 {
55 	size_t l, s;
56 
57 	l = strlen(str);
58 	s = strlen(sufx);
59 
60 	if (l < s)
61 		return 0;
62 
63 	return !strcmp(str + (l - s), sufx);
64 }
65 
66 int
67 unicode_isspace(uint32_t cp)
68 {
69 	if (cp < INT8_MAX)
70 		return isspace(cp);
71 	return 0;
72 }
73 
74 int
75 unicode_isgraph(uint32_t cp)
76 {
77 	if (cp < INT8_MAX)
78 		return isgraph(cp);
79 	return 1;
80 }
81 
82 void
83 imsg_event_add(struct imsgev *iev)
84 {
85 	iev->events = EV_READ;
86 	if (iev->ibuf.w.queued)
87 		iev->events |= EV_WRITE;
88 
89 	event_del(&iev->ev);
90 	event_set(&iev->ev, iev->ibuf.fd, iev->events, iev->handler, iev);
91 	event_add(&iev->ev, NULL);
92 }
93 
94 int
95 dispatch_imsg(struct imsgev *iev, short event, imsg_handlerfn **handlers,
96     size_t size)
97 {
98 	struct imsgbuf	*ibuf;
99 	struct imsg	 imsg;
100 	size_t		 datalen, i;
101 	ssize_t		 n;
102 
103 	ibuf = &iev->ibuf;
104 
105 	if (event & EV_READ) {
106 		if ((n = imsg_read(ibuf)) == -1 && errno != EAGAIN)
107 			err(1, "imsg_read error");
108 		if (n == 0)
109 			return -1;
110 	}
111 	if (event & EV_WRITE) {
112 		if ((n = msgbuf_write(&ibuf->w)) == -1 && errno != EAGAIN)
113 			err(1, "msgbuf_write");
114 		if (n == 0)
115 			return -1;
116 	}
117 
118 	for (;;) {
119 		if ((n = imsg_get(ibuf, &imsg)) == -1)
120 			_exit(1);
121 		if (n == 0)
122 			break;
123 		datalen = IMSG_DATA_SIZE(imsg);
124 		i = imsg.hdr.type;
125 		if (i > (size / sizeof(imsg_handlerfn*)) || handlers[i] == NULL)
126 			abort();
127 		handlers[i](&imsg, datalen);
128 		imsg_free(&imsg);
129 	}
130 
131 	imsg_event_add(iev);
132 	return 0;
133 }
134 
135 int
136 imsg_compose_event(struct imsgev *iev, uint16_t type, uint32_t peerid,
137     pid_t pid, int fd, const void *data, uint16_t datalen)
138 {
139 	int	ret;
140 
141 	if ((ret = imsg_compose(&iev->ibuf, type, peerid, pid, fd, data,
142 	    datalen) != -1))
143 		imsg_event_add(iev);
144 
145 	return ret;
146 }
147 
148 void *
149 hash_alloc(size_t len, void *d)
150 {
151 	if ((d = malloc(len)) == NULL)
152 		abort();
153 	return d;
154 }
155 
156 void *
157 hash_calloc(size_t nmemb, size_t size, void *d)
158 {
159 	if ((d = calloc(nmemb, size)) == NULL)
160 		abort();
161 	return d;
162 }
163 
164 void
165 hash_free(void *ptr, void *d)
166 {
167 	free(ptr);
168 }