|
|
1.1 root 1: /*
2: * Copyright (c) 1983 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted
6: * provided that the above copyright notice and this paragraph are
7: * duplicated in all such forms and that any documentation,
8: * advertising materials, and other materials related to such
9: * distribution and use acknowledge that the software was developed
10: * by the University of California, Berkeley. The name of the
11: * University may not be used to endorse or promote products derived
12: * from this software without specific prior written permission.
13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
16: */
17:
18: #ifndef lint
19: char copyright[] =
20: "@(#) Copyright (c) 1983 Regents of the University of California.\n\
21: All rights reserved.\n";
22: #endif /* not lint */
23:
24: #ifndef lint
25: static char sccsid[] = "@(#)talk.c 5.4 (Berkeley) 6/29/88";
26: #endif /* not lint */
27:
28: #include "talk.h"
29:
30: /*
31: * talk: A visual form of write. Using sockets, a two way
32: * connection is set up between the two people talking.
33: * With the aid of curses, the screen is split into two
34: * windows, and each users text is added to the window,
35: * one character at a time...
36: *
37: * Written by Kipp Hickman
38: *
39: * Modified to run under 4.1a by Clem Cole and Peter Moore
40: * Modified to run between hosts by Peter Moore, 8/19/82
41: * Modified to run under 4.1c by Peter Moore 3/17/83
42: */
43:
44: main(argc, argv)
45: int argc;
46: char *argv[];
47: {
48: get_names(argc, argv);
49: init_display();
50: open_ctl();
51: open_sockt();
52: start_msgs();
53: if (!check_local())
54: invite_remote();
55: end_msgs();
56: set_edit_chars();
57: talk();
58: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.