| /external/srec/srec/Semproc/include/ |
| SR_SemanticGraphImpl.h | 86 arc_token* arc_token_list; member in struct:SR_SemanticGraphImpl_t
116 arc_token* arc_tokens_find_ilabel(arc_token* base, arc_token* arc_token_list, wordID wdid);
|
| /external/srec/srec/Semproc/src/ |
| SemanticGraphImpl.c | 152 if (impl->arc_token_list != NULL)
154 FREE(impl->arc_token_list);
155 impl->arc_token_list = NULL;
196 /* convert these to an arc_token_list or whatever */
246 static arc_token_lnk get_first_arc_leaving_node1(arc_token* arc_token_list,
253 if ((nodeID)(int)arc_token_list[i].next_token_index == node)
254 return ARC_TOKEN_LNK(arc_token_list, i);
284 arc_token* arc_token_list; local
414 semgraph->arc_token_list = NEW_ARRAY(arc_token,max_num_arc_tokens, L("semgraph.wordgraph"));
415 arc_token_list = semgraph->arc_token_list
638 arc_token *atoken, *arc_token_list = impl->arc_token_list; local
[all...] |
| /external/srec/srec/crec/ |
| astar.c | 56 The word graph is represented as an arc_token_list,
72 arc_token* arc_token_list = context->arc_token_list; local
84 root_arc.first_next_arc = ARC_TOKEN_LNK(arc_token_list, 0);
92 atoken = &arc_token_list[0];
93 for (; atoken; atoken = ARC_TOKEN_PTR(arc_token_list, atoken->next_token_index))
99 for (tmp = ARC_TOKEN_PTR(arc_token_list, atoken->first_next_arc); tmp;
100 tmp = ARC_TOKEN_PTR(arc_token_list, tmp->next_token_index))
115 tmp = ARC_TOKEN_PTR(arc_token_list, atoken->first_next_arc);
124 for (tmp = ARC_TOKEN_PTR(arc_token_list, atoken->first_next_arc); tmp
173 arc_token* arc_token_list = context->arc_token_list; local
665 arc_token* arc_token_list; \/* to skip graph constraints, just set this to NULL *\/ local
[all...] |
| srec_context.c | 1775 arc_token *arc_token_list, *tmp; local
[all...] |
| /external/srec/srec/include/ |
| srec_context.h | 141 arc_token* arc_token_list; member in struct:srec_context
236 arc_token_lnk get_first_arc_leaving_node(arc_token* arc_token_list, arcID num_arcs, nodeID node);
|
