2N/A/*
2N/A * CDDL HEADER START
2N/A *
2N/A * The contents of this file are subject to the terms of the
2N/A * Common Development and Distribution License, Version 1.0 only
2N/A * (the "License"). You may not use this file except in compliance
2N/A * with the License.
2N/A *
2N/A * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
2N/A * or http://www.opensolaris.org/os/licensing.
2N/A * See the License for the specific language governing permissions
2N/A * and limitations under the License.
2N/A *
2N/A * When distributing Covered Code, include this CDDL HEADER in each
2N/A * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
2N/A * If applicable, add the following below this CDDL HEADER, with the
2N/A * fields enclosed by brackets "[]" replaced with your own identifying
2N/A * information: Portions Copyright [yyyy] [name of copyright owner]
2N/A *
2N/A * CDDL HEADER END
2N/A */
2N/A/*
2N/A * Copyright (c) 1995-1998 by Sun Microsystems, Inc.
2N/A * All rights reserved.
2N/A */
2N/A
2N/A#pragma ident "%Z%%M% %I% %E% SMI"
2N/A
2N/A/* LINTLIBRARY */
2N/A
2N/A/*
2N/A * ptrmove.c
2N/A *
2N/A * Copyright 1990, 1995 by Mortice Kern Systems Inc. All rights reserved.
2N/A *
2N/A */
2N/A
2N/A#ifdef M_RCSID
2N/A#ifndef lint
2N/Astatic char rcsID[] = "$Header: /rd/src/libc/xcurses/rcs/ptrmove.c 1.3 "
2N/A"1995/05/18 20:55:05 ant Exp $";
2N/A#endif
2N/A#endif
2N/A
2N/A#include <private.h>
2N/A
2N/Astatic void reverse(void **, unsigned int, unsigned int);
2N/A
2N/A/*
2N/A * Move range start..finish inclusive before the given location.
2N/A * Return -1 if the region to move is out of bounds or the target
2N/A * falls within the region; 0 for success.
2N/A *
2N/A * (See Software Tools chapter 6.)
2N/A */
2N/Aint
2N/A__m_ptr_move(void **array, unsigned int length,
2N/A unsigned int start, unsigned int finish, unsigned int to)
2N/A{
2N/A if (finish < start || length <= finish)
2N/A return (-1);
2N/A
2N/A if (to < start) {
2N/A reverse(array, to, start-1);
2N/A reverse(array, start, finish);
2N/A reverse(array, to, finish);
2N/A } else if (finish < to && to <= length) {
2N/A reverse(array, start, finish);
2N/A reverse(array, finish+1, to-1);
2N/A reverse(array, start, to-1);
2N/A } else {
2N/A return (-1);
2N/A }
2N/A
2N/A return (0);
2N/A}
2N/A
2N/A/*
2N/A * Reverse range a..b inclusive.
2N/A */
2N/Astatic void
2N/Areverse(void **ptr, unsigned int a, unsigned int b)
2N/A{
2N/A void *temp;
2N/A void **a_ptr = &ptr[a];
2N/A void **b_ptr = &ptr[b];
2N/A
2N/A while (a_ptr < b_ptr) {
2N/A temp = *a_ptr;
2N/A *a_ptr++ = *b_ptr;
2N/A *b_ptr-- = temp;
2N/A }
2N/A}