]>
Commit | Line | Data |
---|---|---|
e9ce8d39 A |
1 | /* |
2 | * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. | |
3 | * | |
4 | * @APPLE_LICENSE_HEADER_START@ | |
5 | * | |
734aad71 | 6 | * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved. |
e9ce8d39 | 7 | * |
734aad71 A |
8 | * This file contains Original Code and/or Modifications of Original Code |
9 | * as defined in and that are subject to the Apple Public Source License | |
10 | * Version 2.0 (the 'License'). You may not use this file except in | |
11 | * compliance with the License. Please obtain a copy of the License at | |
12 | * http://www.opensource.apple.com/apsl/ and read it before using this | |
13 | * file. | |
14 | * | |
15 | * The Original Code and all software distributed under the License are | |
16 | * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER | |
e9ce8d39 A |
17 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, |
18 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, | |
734aad71 A |
19 | * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. |
20 | * Please see the License for the specific language governing rights and | |
21 | * limitations under the License. | |
e9ce8d39 A |
22 | * |
23 | * @APPLE_LICENSE_HEADER_END@ | |
24 | */ | |
25 | /* Copyright (c) 1992, 1997 NeXT Software, Inc. All rights reserved. | |
26 | * | |
27 | * File: libc/gen/ppc/remque.c | |
28 | * | |
29 | * struct qelem { | |
30 | * struct qelem *q_forw; | |
31 | * struct qelem *q_back; | |
32 | * char q_data[]; | |
33 | * }; | |
34 | * | |
35 | * void remque(struct qelem *entry); | |
36 | * | |
37 | * Removes `entry' from a queue. | |
38 | * | |
39 | * HISTORY | |
40 | * 24-Jan-1997 Umesh Vaishampayan (umeshv@NeXT.com) | |
41 | * Ported to PPC. | |
42 | * 10-Nov-92 Derek B Clegg (dclegg@next.com) | |
43 | * Created. | |
44 | */ | |
45 | #import <libc.h> | |
46 | ||
47 | void | |
48 | remque(struct qelem *elem) | |
49 | { | |
50 | struct qelem *next, *prev; | |
51 | ||
52 | next = elem->q_forw; | |
53 | prev = elem->q_back; | |
54 | if (next != 0) | |
55 | next->q_back = prev; | |
56 | if (prev != 0) | |
57 | prev->q_forw = next; | |
58 | } |