/*	$OpenBSD: filecomplete.c,v 1.12 2016/04/11 20:43:33 schwarze Exp $ */

/*	$NetBSD: filecomplete.c,v 1.22 2010/12/02 04:42:46 dholland Exp $	*/

/*-

 * Copyright (c) 1997 The NetBSD Foundation, Inc.

 * All rights reserved.

 *

 * This code is derived from software contributed to The NetBSD Foundation

 * by Jaromir Dolecek.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions

 * are met:

 * 1. Redistributions of source code must retain the above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. Redistributions in binary form must reproduce the above copyright

 *    notice, this list of conditions and the following disclaimer in the

 *    documentation and/or other materials provided with the distribution.

 *

 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS

 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED

 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS

 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR

 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF

 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS

 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN

 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)

 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE

 * POSSIBILITY OF SUCH DAMAGE.

 */

#include "config.h"

#include <sys/types.h>

#include <sys/stat.h>

#include <dirent.h>

#include <errno.h>

#include <fcntl.h>

#include <limits.h>

#include <pwd.h>

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <unistd.h>

#include "el.h"

#include "filecomplete.h"

static const wchar_t break_chars[] = L" \t\n\"\\'`@$><=;|&{(";

/********************************/

/* completion functions */

/*

 * does tilde expansion of strings of type ``~user/foo''

 * if ``user'' isn't valid user name or ``txt'' doesn't start

 * w/ '~', returns pointer to strdup()ed copy of ``txt''

 *

 * it's the caller's responsibility to free() the returned string

 */

char *

fn_tilde_expand(const char *txt)

{

	char *temp;

	size_t tempsz, len = 0;

	} else {

	}

	} else {

	}

	/* update pointer txt to point at string immedially following */

	/* first slash */

}

/*

 * return first found file name starting by the ``text'' or NULL if no

 * such file can be found

 * value of ``state'' is ignored

 *

 * it's the caller's responsibility to free the returned string

 */

char *

fn_filename_completion_function(const char *text, int state)

{

	static DIR *dir = NULL;

	static char *filename = NULL, *dirname = NULL, *dirpath = NULL;

	static size_t filename_len = 0;

	struct dirent *entry;

	char *temp;

	size_t tempsz, len;

			char *nptr;

			}

			}

			else {

			}

		}

		}

		/* support for ``~user'' syntax */

		else

		/* will be used in cycle */

	}

	/* find the match */

		/* skip . and .. */

			continue;

			break;

		/* otherwise, get first entry where first */

		/* filename_len characters are equal	  */

#if HAVE_STRUCT_DIRENT_D_NAMLEN

#else

		    && strlen(entry->d_name) >= filename_len

#endif

			break;

	}

#if HAVE_STRUCT_DIRENT_D_NAMLEN

#else

		len = strlen(entry->d_name);

#endif

		temp = NULL;

	}

}

static const char *

append_char_function(const char *name)

{

	const char *rs = " ";

		goto out;

out:

}

/*

 * returns list of completions for text given

 * non-static for readline.

 */

char ** completion_matches(const char *, char *(*)(const char *, int));

char **

completion_matches(const char *text, char *(*genfunc)(const char *, int))

{

	char **match_list = NULL, *retstr, *prevstr;

	size_t match_list_len, max_equal, which, i;

	size_t matches;

	matches = 0;

	match_list_len = 1;

		/* allow for list terminator here */

			char **nmatch_list;

			    match_list_len, sizeof(char *));

			}

			match_list = nmatch_list;

		}

	}

	/* find least denominator and insert it to match_list[0] */

	which = 2;

			continue;

		max_equal = i;

	}

	}

	/* add NULL as last pointer to the array */

}

/*

 * Sort function for qsort(). Just wrapper around strcasecmp().

 */

static int

_fn_qsort_string_compare(const void *i1, const void *i2)

{

}

/*

 * Display list of strings in columnar format on readline's output stream.

 * 'matches' is list of strings, 'num' is number of strings in 'matches',

 * 'width' is maximum length of string in 'matches'.

 *

 * matches[0] is not one of the match strings, but it is counted in

 * num, so the strings are matches[1] *through* matches[num-1].

 */

void

fn_display_match_list (EditLine *el, char **matches, size_t num, size_t width)

{

	size_t line, lines, col, cols, thisguy;

	/* Ignore matches[0]. Avoid 1-based array logic below. */

	/*

	 * Find out how many entries can be put on one line; count

	 * with one space between strings the same way it's printed.

	 */

		cols = 1;

	/* how many lines of output, rounded up */

	/* Sort the items. */

	/*

	 * On the ith line print elements i, i+lines, i+lines*2, etc.

	 */

				break;

		}

	}

}

/*

 * Complete the word at or before point,

 * 'what_to_do' says what to do with the completion.

 * \t   means do standard completion.

 * `?' means list the possible completions.

 * `*' means insert all of the possible completions.

 * `!' means to do standard completion, and list all possible completions if

 * there is more than one.

 *

 * Note: '*' support is not implemented

 *       '!' could never be invoked

 */

int

fn_complete(EditLine *el,

	char *(*complet_func)(const char *, int),

	char **(*attempted_completion_function)(const char *, int, int),

	const wchar_t *word_break, const wchar_t *special_prefixes,

	const char *(*app_func)(const char *), size_t query_items,

	int *completion_type, int *over, int *point, int *end)

{

	const LineInfoW *li;

	wchar_t *temp;

        char **matches;

	const wchar_t *ctemp;

	size_t len;

	int what_to_do = '\t';

	int retval = CC_NORM;

	/* readline's rl_complete() has to be told what we did... */

	/* We now look backwards for the start of a filename/variable word */

	/* these can be used by function called in completion_matches() */

	/* or (*attempted_completion_function)() */

		matches = NULL;

		int i;

		size_t matches_num, maxlen, match_len, match_display=1;

		retval = CC_REFRESH;

		/*

		 * Only replace the completed string with common part of

		 * possible matches if there is possible completion.

		 */

		}

			goto display_matches;

			/*

			 * We found exact match. Add a space after

			 * it, unless we do filename completion and the

			 * object is a directory.

			 */

    display_matches:

			/*

			 * More than one match and requested to list possible

			 * matches.

			 */

			}

			/* matches[1] through matches[i-1] are available */

			/* newline to get on next line from command line */

			/*

			 * If there are too many items, ask user for display

			 * confirmation.

			 */

				    "Display all %zu possibilities? (y or n) ",

				    matches_num);

			}

				/*

				 * Interface of this function requires the

				 * strings be matches[1..num-1] for compat.

				 * We have matches_num strings not counting

				 * the prefix in matches[0], so we need to

				 * add 1 to matches_num for the call.

				 */

			}

			retval = CC_REDISPLAY;

			/*

			 * There was some common match, but the name was

			 * not complete enough. Next tab will print possible

			 * completions.

			 */

		} else {

			/* lcd is not a valid object - further specification */

			/* is needed */

			el_beep(el);

			retval = CC_NORM;

		}

		/* free elements of array and the array itself */

		matches = NULL;

	}

}

/*

 * el-compatible wrapper around rl_complete; needed for key binding

 */

/* ARGSUSED */

unsigned char

_el_fn_complete(EditLine *el, int ch __attribute__((__unused__)))

{

	    break_chars, NULL, NULL, 100,

	    NULL, NULL, NULL, NULL);

}