1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
/* ASCEND modelling environment
Copyright (C) 2006 Benjamin Andrew Allan
Copyright (C) 2006 Carnegie Mellon University
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*//** @file
* Ascend Instance Tree Name Search Routines.
*//*
by Ben Allan
Created: 10/3/2006
*/
#ifndef ASC_FINDPATH_H
#define ASC_FINDPATH_H
#include <ascend/general/list.h>
#include "instance_enum.h"
#include "find.h"
/** @addtogroup compiler_inst Compiler Instance Hierarchy
@{
*/
extern struct gl_list_t *FindInstancesPaths(CONST struct Instance *i,
CONST struct Name *n,
rel_errorlist *err);
/**<
* Return the list of Names expanded from n that have instances.
* Don't forget to destroy the names in the list before destroying list.
* If this returns NULL,
* it indicates that it couldn't find something in the name.
* Check err to discover why.
*/
/* @} */
#endif /* ASC_FINDPATH_H */
|