Archived
1
Fork 0
This repository has been archived on 2024-10-07. You can view files and clone it, but cannot push or open issues or pull requests.
kilo/kilo.c

416 lines
9.2 KiB
C
Raw Normal View History

2023-08-25 22:49:55 +00:00
#define _BSD_SOURCE
#define _DEFAULT_SOURCE
#define _GNU_SOURCE
2023-08-24 12:57:25 +00:00
#include <ctype.h>
#include <errno.h>
2023-08-26 04:47:07 +00:00
#include <limits.h>
2023-08-24 12:57:25 +00:00
#include <stdbool.h>
2023-08-25 22:49:55 +00:00
#include <stdint.h>
2023-08-22 21:32:16 +00:00
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
2023-08-24 11:09:03 +00:00
#include <sys/ioctl.h>
2023-08-22 21:32:16 +00:00
#include <termios.h>
#include <unistd.h>
#define CTRL_KEY(key) ((key) & 0x1f)
/*****************************************************************************/
2023-08-25 22:49:55 +00:00
struct screen_buf;
struct input_buf;
2023-08-26 04:47:07 +00:00
struct erow {
int size;
char *s;
};
2023-08-25 22:49:55 +00:00
struct {
2023-08-25 22:49:55 +00:00
int cx, cy;
2023-08-26 04:47:07 +00:00
int screenrows, screencols;
int display_rows;
2023-08-25 22:49:55 +00:00
bool running;
2023-08-26 04:47:07 +00:00
struct erow row;
struct termios orig_termios;
struct input_buf *ib;
} E;
2023-08-26 04:47:07 +00:00
enum KEYS {
HOME = 0x100,
DEL,
PG_UP,
PG_DOWN,
END,
ARROW_UP,
ARROW_DOWN,
ARROW_LEFT,
ARROW_RIGHT,
NOP
};
2023-08-26 04:47:07 +00:00
typedef uint16_t KEY;
/*****************************************************************************/
2023-08-23 23:27:25 +00:00
2023-08-24 11:09:03 +00:00
void editor_init();
2023-08-26 04:47:07 +00:00
void editor_open();
2023-08-23 23:27:25 +00:00
void editor_redraw_screen();
void editor_draw_rows(struct screen_buf *);
2023-08-23 23:27:25 +00:00
void editor_process_key();
2023-08-25 22:49:55 +00:00
void editor_free();
struct screen_buf *sb_init();
void sb_append(struct screen_buf *, const char *);
2023-08-26 04:47:07 +00:00
void sb_append_max(struct screen_buf *, const char *, int);
2023-08-25 22:49:55 +00:00
void sb_write(struct screen_buf *);
void sb_free(struct screen_buf *);
2023-08-26 04:47:07 +00:00
struct input_buf *ib_init(int);
2023-08-25 22:49:55 +00:00
KEY ib_read(struct input_buf *);
void ib_write(struct input_buf *, KEY);
bool ib_empty(struct input_buf *);
void ib_free(struct input_buf *);
2023-08-23 23:27:25 +00:00
int term_enable_raw();
void term_disable_raw();
int term_clear();
int term_cursor_hidden(bool);
int term_get_win_size(int *, int *);
int term_get_cursor_pos(int *, int *);
int term_set_cursor_pos(int, int);
2023-08-25 22:49:55 +00:00
KEY term_read_key();
2023-08-24 11:09:03 +00:00
void die(const char *);
2023-08-23 23:27:25 +00:00
/*****************************************************************************/
2023-08-22 21:32:16 +00:00
2023-08-23 23:27:25 +00:00
int main() {
2023-08-24 11:09:03 +00:00
editor_init();
2023-08-26 04:47:07 +00:00
editor_open();
2023-08-24 11:09:03 +00:00
2023-08-25 22:49:55 +00:00
while (E.running) {
2023-08-23 23:27:25 +00:00
editor_redraw_screen();
editor_process_key();
}
2023-08-22 21:32:16 +00:00
2023-08-25 22:49:55 +00:00
editor_free();
2023-08-23 23:27:25 +00:00
return 0;
2023-08-22 21:32:16 +00:00
}
/*****************************************************************************/
2023-08-24 12:57:25 +00:00
void editor_init() {
if (!isatty(STDIN_FILENO)) {
printf("kilo only supports a terminal at standard in. Exiting.");
exit(1);
}
if (term_enable_raw() == -1) die("term_enable_raw");
2023-08-25 22:49:55 +00:00
E.cx = E.cy = 0;
2023-08-26 04:47:07 +00:00
if (term_get_win_size(&E.screenrows, &E.screencols) == -1) die("term_get_win_size");
E.display_rows = 0;
2023-08-25 22:49:55 +00:00
E.running = true;
2023-08-26 04:47:07 +00:00
E.ib = ib_init(128);
}
void editor_open() {
char *line = "hello world";
int line_len = (int) strlen(line);
E.row.s = line;
E.row.size = line_len;
E.display_rows = 1;
}
void editor_redraw_screen() {
if (term_cursor_hidden(true) == -1) die("term_cursor_hidden");
struct screen_buf *sb = sb_init();
editor_draw_rows(sb);
sb_write(sb);
sb_free(sb);
if (term_set_cursor_pos(E.cy + 1, E.cx + 1) == -1) die("term_set_cursor_pos");
if (term_cursor_hidden(false) == -1) die("term_cursor_hidden");
}
void editor_draw_rows(struct screen_buf *sb) {
term_set_cursor_pos(1, 1);
2023-08-25 22:49:55 +00:00
for (int y = 0; y < E.screenrows; y++) {
2023-08-26 04:47:07 +00:00
if (y < E.display_rows) {
sb_append_max(sb, E.row.s, E.screencols);
} else sb_append(sb, "~");
2023-08-24 12:57:25 +00:00
sb_append(sb, "\x1b[K"); // Clear rest of the line
2023-08-25 22:49:55 +00:00
if (y < E.screenrows - 1) sb_append(sb, "\r\n");
}
2023-08-24 12:57:25 +00:00
}
void editor_process_key() {
2023-08-25 22:49:55 +00:00
KEY c = ib_read(E.ib);
switch (c) {
case ARROW_LEFT:
if (E.cx > 0) E.cx--;
break;
case ARROW_DOWN:
2023-08-25 22:49:55 +00:00
if (E.cy < E.screenrows - 1) E.cy++;
break;
case ARROW_UP:
if (E.cy > 0) E.cy--;
break;
case ARROW_RIGHT:
2023-08-25 22:49:55 +00:00
if (E.cx < E.screencols - 1) E.cx++;
break;
case HOME:
E.cx = 0;
break;
case END:
E.cx = E.screencols - 1;
break;
case PG_UP:
case PG_DOWN:
for (int i = 0; i < E.screenrows; i++)
ib_write(E.ib, (c == PG_UP ? ARROW_UP : ARROW_DOWN));
break;
case CTRL_KEY('Q'):
E.running = false;
break;
}
}
2023-08-25 22:49:55 +00:00
void editor_free() {
term_clear();
ib_free(E.ib);
}
2023-08-25 22:49:55 +00:00
/*****************************************************************************/
2023-08-25 22:49:55 +00:00
struct screen_buf {
2023-08-26 04:47:07 +00:00
int size;
2023-08-25 22:49:55 +00:00
char *s;
};
2023-08-25 22:49:55 +00:00
struct screen_buf *sb_init() {
struct screen_buf *sb = (struct screen_buf *) malloc(sizeof(struct screen_buf));
2023-08-25 22:49:55 +00:00
sb->s = NULL;
sb->size = 0;
2023-08-25 22:49:55 +00:00
return sb;
}
2023-08-25 22:49:55 +00:00
void sb_append(struct screen_buf *sb, const char *s) {
2023-08-26 04:47:07 +00:00
sb_append_max(sb, s, INT_MAX);
}
void sb_append_max(struct screen_buf *sb, const char *s, int max_size) {
2023-08-25 22:49:55 +00:00
int size = strlen(s);
2023-08-26 04:47:07 +00:00
size = (size > max_size ? max_size : size);
2023-08-25 22:49:55 +00:00
sb->s = realloc(sb->s, sb->size + size);
memcpy(sb->s + sb->size, s, size);
sb->size += size;
}
void sb_write(struct screen_buf *sb) {
write(STDOUT_FILENO, sb->s, sb->size);
}
void sb_free(struct screen_buf *sb) {
free(sb->s);
free(sb);
}
struct input_buf {
KEY *carr; // Circular array
int read_i;
int write_i;
2023-08-26 04:47:07 +00:00
int capacity; // Actual capacity is one less
2023-08-25 22:49:55 +00:00
};
2023-08-26 04:47:07 +00:00
struct input_buf *ib_init(int capacity) {
struct input_buf *ib = malloc(sizeof(struct input_buf));
2023-08-25 22:49:55 +00:00
ib->carr = (KEY *) malloc(sizeof(KEY) * capacity);
ib->write_i = 0;
ib->read_i = 0;
ib->capacity = capacity;
return ib;
}
void ib_write(struct input_buf *ib, KEY key) {
if ((ib->write_i + 1) % (int) ib->capacity == ib->read_i) // Buffer full
die("ib_write");
ib->carr[ib->write_i] = key;
ib->write_i = (ib->write_i + 1) % ib->capacity;
}
KEY ib_read(struct input_buf *ib) {
if (ib_empty(ib)) ib_write(ib, term_read_key());
KEY key = ib->carr[ib->read_i];
ib->read_i = (ib->read_i + 1) % ib->capacity;
return key;
}
bool ib_empty(struct input_buf *ib) {
return ib->write_i == ib->read_i;
}
void ib_free(struct input_buf *ib) {
free(ib->carr);
free(ib);
}
/*****************************************************************************/
int term_enable_raw() {
if (tcgetattr(STDIN_FILENO, &E.orig_termios) == -1) return -1;
atexit(term_disable_raw);
2023-08-22 21:32:16 +00:00
2023-08-24 11:09:03 +00:00
struct termios raw = E.orig_termios;
2023-08-23 16:36:42 +00:00
cfmakeraw(&raw);
2023-08-22 21:32:16 +00:00
2023-08-24 12:57:25 +00:00
raw.c_cc[VMIN] = 0;
2023-08-25 22:49:55 +00:00
raw.c_cc[VTIME] = 10;
2023-08-24 12:57:25 +00:00
if (tcsetattr(STDIN_FILENO, TCSAFLUSH, &raw) == -1) return -1;
return 0;
2023-08-22 21:32:16 +00:00
}
void term_disable_raw() {
2023-08-24 11:09:03 +00:00
if (tcsetattr(STDIN_FILENO, TCSAFLUSH, &E.orig_termios) == -1)
die ("term_disable_raw");
2023-08-23 23:27:25 +00:00
}
2023-08-22 21:32:16 +00:00
int term_clear() {
if (write(STDOUT_FILENO, "\x1b[2J", 4) != 4) return -1;
if (write(STDOUT_FILENO, "\x1b[H", 3) != 3) return -1;
return 0;
}
int term_cursor_hidden(bool hidden) {
if (write(STDOUT_FILENO, (hidden ? "\x1b[?25l" : "\x1b[?25h"), 6) != 6)
return -1;
return 0;
}
int term_get_win_size(int *row, int *col) {
2023-08-24 11:09:03 +00:00
struct winsize ws;
2023-08-24 12:57:25 +00:00
if (ioctl(STDOUT_FILENO, TIOCGWINSZ, &ws) != -1 && ws.ws_col != 0) {
*row = ws.ws_row;
*col = ws.ws_col;
2023-08-24 11:09:03 +00:00
return 0;
2023-08-24 12:57:25 +00:00
} else {
if (write(STDOUT_FILENO, "\x1b[999C\x1b[999B", 12) != 12) return -1;
return term_get_cursor_pos(row, col);
2023-08-24 11:09:03 +00:00
}
}
int term_get_cursor_pos(int *row, int *col) {
2023-08-24 12:57:25 +00:00
char buf[32];
2023-08-24 11:09:03 +00:00
2023-08-24 12:57:25 +00:00
if (write(STDOUT_FILENO, "\x1b[6n", 4) != 4) return -1;
2023-08-26 04:47:07 +00:00
for (int i = 0; i < (int) sizeof(buf); i++) {
if (read(STDIN_FILENO, buf+i, 1) == 0 || buf[i] == 'R') {
buf[i] = '\0';
break;
}
}
2023-08-24 12:57:25 +00:00
if (sscanf(buf, "\x1b[%d;%d", row, col) == EOF)
return -1;
2023-08-24 12:57:25 +00:00
return 0;
2023-08-24 11:09:03 +00:00
}
int term_set_cursor_pos(int row, int col) {
char buf[16];
2023-08-22 21:32:16 +00:00
2023-08-26 04:47:07 +00:00
int len = snprintf(buf, sizeof(buf), "\x1b[%d;%dH", row, col);
len = (len >= (int) sizeof(buf) ? (int) sizeof(buf) - 1 : len);
2023-08-23 23:27:25 +00:00
2023-08-26 04:47:07 +00:00
if ((int) write(STDOUT_FILENO, buf, len) != len) return -1;
return 0;
}
2023-08-25 22:49:55 +00:00
KEY term_read_key() {
char c;
while (read(STDIN_FILENO, &c, 1) == 0);
2023-08-25 22:49:55 +00:00
if (c == '\x1b') {
char buf[8] = { '\0' };
2023-08-25 22:49:55 +00:00
// Inefficient but I like the way it looks
2023-08-26 04:47:07 +00:00
for (int i = 0; i < (int) sizeof(buf); i++) {
2023-08-25 22:49:55 +00:00
if (read(STDIN_FILENO, buf+i, 1) == 0) break;
char escape_char;
if (sscanf(buf, "[%c~", &escape_char) != EOF) {
switch (escape_char) {
case 'A': return ARROW_UP;
case 'B': return ARROW_DOWN;
case 'C': return ARROW_RIGHT;
case 'D': return ARROW_LEFT;
case 'H': return HOME;
case 'F': return END;
}
}
2023-08-25 22:49:55 +00:00
int escape_int;
if (sscanf(buf, "[%d~", &escape_int) != EOF) {
switch (escape_int) {
case 1:
case 7:
return HOME;
case 3:
return DEL;
case 4:
case 8:
return END;
case 5:
return PG_UP;
case 6:
return PG_DOWN;
}
}
}
2023-08-25 22:49:55 +00:00
return NOP;
}
2023-08-25 22:49:55 +00:00
return (KEY) c;
}
/*****************************************************************************/
void die(const char *s) {
term_clear();
perror(s);
exit(1);
}