summaryrefslogtreecommitdiff
path: root/input.c
blob: f8a086ce7a061a6344b69d6117640a77bf3e14cb (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/*
 * UNG's Not GNU
 *
 * Copyright (c) 2011-2017, Jakob Kaivo <jkk@ung.org>
 *
 * Permission to use, copy, modify, and/or distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 */

#include "ed.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <search.h>

static struct ed_line *ed_input(void)
{
	struct ed_line *head = NULL;
	struct ed_line *tail = NULL;

	for (;;) {
		struct ed_line *line = calloc(1, sizeof(*line));
		size_t n;

		getline(&(line->text), &n, stdin);
		if (!strcmp(line->text, ".\n")) {
			free(line->text);
			free(line);
			break;
		}

		insque(line, tail);
		if (head == NULL) {
			head = line;
		}
		tail = line;
	}

	return head;
}

void ed_append(intmax_t start, intmax_t end, const char *arg) { (void)start; (void)end; (void)arg; }
void ed_change(intmax_t start, intmax_t end, const char *arg) { (void)start; (void)end; (void)arg; }

void ed_insert(intmax_t start, intmax_t end, const char *arg)
{
	(void)start; (void)end; (void)arg;
	struct ed_line *input = ed_input();
	insque(input, ed_state.current);
}