⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 insremque.c

📁 一个C源代码分析器
💻 C
字号:
/* Copyright (C) 1992 Free Software Foundation, Inc.This file is part of the GNU C Library.The GNU C Library is free software; you can redistribute it and/ormodify it under the terms of the GNU Library General Public License aspublished by the Free Software Foundation; either version 2 of theLicense, or (at your option) any later version.The GNU C Library is distributed in the hope that it will be useful,but WITHOUT ANY WARRANTY; without even the implied warranty ofMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNULibrary General Public License for more details.You should have received a copy of the GNU Library General PublicLicense along with the GNU C Library; see the file COPYING.LIB.  Ifnot, write to the Free Software Foundation, Inc., 675 Mass Ave,Cambridge, MA 02139, USA.  */#include <ansidecl.h>#include <stddef.h>struct qelem  {    struct qelem *q_forw;    struct qelem *q_back;    char q_data[1];  };/* Insert ELEM into a doubly-linked list, after PREV.  */voidDEFUN(insque, (elem, prev) ,      struct qelem *elem AND struct qelem *prev){  struct qelem *next = prev->q_forw;  prev->q_forw = elem;  if (next != NULL)    next->q_back = elem;  elem->q_forw = next;  elem->q_back = prev;}/* Unlink ELEM from the doubly-linked list that it is in.  */voidDEFUN(remque, (elem),      struct qelem *elem){  struct qelem *next = elem->q_forw;  struct qelem *prev = elem->q_back;  if (next != NULL)    next->q_back = prev;  if (prev != NULL)    prev->q_forw = next;}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -