Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- add list for simulation_events git-svn-id: https://openmodelica.org/svn/OpenModelica/trunk@10411 f25d12d1-65f4-0310-ae8a-bbce733d8d8e
- Loading branch information
Jens Frenkel
committed
Nov 10, 2011
1 parent
a92e823
commit c630f5c
Showing
9 changed files
with
407 additions
and
161 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,118 @@ | ||
| /* | ||
| * This file is part of OpenModelica. | ||
| * | ||
| * Copyright (c) 1998-CurrentYear, Linköping University, | ||
| * Department of Computer and Information Science, | ||
| * SE-58183 Linköping, Sweden. | ||
| * | ||
| * All rights reserved. | ||
| * | ||
| * THIS PROGRAM IS PROVIDED UNDER THE TERMS OF GPL VERSION 3 | ||
| * AND THIS OSMC PUBLIC LICENSE (OSMC-PL). | ||
| * ANY USE, REPRODUCTION OR DISTRIBUTION OF THIS PROGRAM CONSTITUTES RECIPIENT'S | ||
| * ACCEPTANCE OF THE OSMC PUBLIC LICENSE. | ||
| * | ||
| * The OpenModelica software and the Open Source Modelica | ||
| * Consortium (OSMC) Public License (OSMC-PL) are obtained | ||
| * from Linköping University, either from the above address, | ||
| * from the URLs: http://www.ida.liu.se/projects/OpenModelica or | ||
| * http://www.openmodelica.org, and in the OpenModelica distribution. | ||
| * GNU version 3 is obtained from: http://www.gnu.org/copyleft/gpl.html. | ||
| * | ||
| * This program is distributed WITHOUT ANY WARRANTY; without | ||
| * even the implied warranty of MERCHANTABILITY or FITNESS | ||
| * FOR A PARTICULAR PURPOSE, EXCEPT AS EXPRESSLY SET FORTH | ||
| * IN THE BY RECIPIENT SELECTED SUBSIDIARY LICENSE CONDITIONS | ||
| * OF OSMC-PL. | ||
| * | ||
| * See the full OSMC Public License conditions for more details. | ||
| * | ||
| */ | ||
|
|
||
| /* File: list.c | ||
| * | ||
| * Description: This file is a C header file for the simulation runtime. | ||
| * It contains a simple linked list | ||
| */ | ||
|
|
||
| #include "list.h" | ||
| #include <stdlib.h> | ||
| #include <assert.h> | ||
|
|
||
| void list_push_front(int data, List *list) | ||
| { | ||
| List_Node *new_node = 0; | ||
| assert(list); | ||
| new_node = (List_Node*) malloc(sizeof(List_Node)); | ||
| new_node->data = data; | ||
| new_node->next = list->first; | ||
| list->first = new_node; | ||
| if (list->last == NULL) { | ||
| list->last = list->first; | ||
| } | ||
| } | ||
|
|
||
| void list_push_back(int data, List *list) | ||
| { | ||
| List_Node *new_node = 0; | ||
| assert(list==0?0:1); | ||
| new_node = (List_Node*) malloc(sizeof(List_Node)); | ||
| new_node->data = data; | ||
| new_node->next = 0; | ||
| if (list->last!=NULL) { | ||
| list->last->next = new_node; | ||
| } | ||
| list->last = new_node; | ||
| if (list->first == NULL) { | ||
| list->first = list->last; | ||
| } | ||
| } | ||
|
|
||
| int list_empty(List list) | ||
| { | ||
| return list.first==0?1:0; | ||
| } | ||
|
|
||
| int list_front(List list) | ||
| { | ||
| assert(list.first); | ||
| return list.first->data; | ||
| } | ||
|
|
||
| int list_last(List list) | ||
| { | ||
| assert(list.last); | ||
| return list.last->data; | ||
| } | ||
|
|
||
| void list_pop_front(List *list) | ||
| { | ||
| if (list != NULL) { | ||
| if (list->first != NULL) { | ||
| List_Node *node = list->first->next; | ||
| free(list); | ||
| list->first = node; | ||
| if (list->first == 0) { | ||
| list->last = list->first; | ||
| } | ||
| } | ||
| } | ||
| } | ||
|
|
||
| void list_clear(List *list) | ||
| { | ||
| if (list == NULL) { | ||
| return; | ||
| } | ||
| while(list->first != NULL) { | ||
| list_pop_front(list); | ||
| } | ||
| } | ||
|
|
||
| List_Node* list_next(List_Node* node) | ||
| { | ||
| if (node==0) { | ||
| return 0; | ||
| } | ||
| return node->next; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,75 @@ | ||
| /* | ||
| * This file is part of OpenModelica. | ||
| * | ||
| * Copyright (c) 1998-CurrentYear, Linköping University, | ||
| * Department of Computer and Information Science, | ||
| * SE-58183 Linköping, Sweden. | ||
| * | ||
| * All rights reserved. | ||
| * | ||
| * THIS PROGRAM IS PROVIDED UNDER THE TERMS OF GPL VERSION 3 | ||
| * AND THIS OSMC PUBLIC LICENSE (OSMC-PL). | ||
| * ANY USE, REPRODUCTION OR DISTRIBUTION OF THIS PROGRAM CONSTITUTES RECIPIENT'S | ||
| * ACCEPTANCE OF THE OSMC PUBLIC LICENSE. | ||
| * | ||
| * The OpenModelica software and the Open Source Modelica | ||
| * Consortium (OSMC) Public License (OSMC-PL) are obtained | ||
| * from Linköping University, either from the above address, | ||
| * from the URLs: http://www.ida.liu.se/projects/OpenModelica or | ||
| * http://www.openmodelica.org, and in the OpenModelica distribution. | ||
| * GNU version 3 is obtained from: http://www.gnu.org/copyleft/gpl.html. | ||
| * | ||
| * This program is distributed WITHOUT ANY WARRANTY; without | ||
| * even the implied warranty of MERCHANTABILITY or FITNESS | ||
| * FOR A PARTICULAR PURPOSE, EXCEPT AS EXPRESSLY SET FORTH | ||
| * IN THE BY RECIPIENT SELECTED SUBSIDIARY LICENSE CONDITIONS | ||
| * OF OSMC-PL. | ||
| * | ||
| * See the full OSMC Public License conditions for more details. | ||
| * | ||
| */ | ||
|
|
||
| /* File: list.h | ||
| * | ||
| * Description: This file is a C header file for the simulation runtime. | ||
| * It contains a simple linked list | ||
| */ | ||
|
|
||
| #ifndef _LIST_H | ||
| #define _LIST_H | ||
|
|
||
| #ifdef __cplusplus | ||
| extern "C" { | ||
| #endif | ||
|
|
||
| typedef struct list_node { | ||
| int data; | ||
| struct list_node *next; | ||
| } List_Node; | ||
|
|
||
| typedef struct list_list { | ||
| struct list_node *first; | ||
| struct list_node *last; | ||
| } List; | ||
|
|
||
| void list_push_front(int data, List *list); | ||
|
|
||
| void list_push_back(int data, List *list); | ||
|
|
||
| int list_empty(List list); | ||
|
|
||
| int list_front(List list); | ||
|
|
||
| int list_last(List list); | ||
|
|
||
| void list_pop_front(List *list); | ||
|
|
||
| void list_clear(List *list); | ||
|
|
||
| List_Node* list_next(List_Node* node); | ||
|
|
||
| #ifdef __cplusplus | ||
| } | ||
| #endif | ||
|
|
||
| #endif /* _LIST_H */ |
Oops, something went wrong.