| /src/external/mit/isl/dist/ |
| isl_list_templ.c | 496 * "follows" is the user provided callback that defines the edges of the graph.
500 isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user); variable
508 static isl_bool FN(LIST(EL),follows)(int i, int j, void *user) function
512 return data->follows(data->list->p[i], data->list->p[j],
540 * a directed edge from node b to node a iff follows(a, b)
541 * returns 1. follows should return -1 on error.
543 * If SCC a contains a node i that follows a node j in another SCC b
544 * (i.e., follows(i, j, user) returns 1), then fn will be called on SCC a
551 isl_bool (*follows)(__isl_keep EL *a, __isl_keep EL *b, void *user),
555 S(LIST(EL),foreach_scc_data) data = { list, follows, follows_user }
[all...] |
| isl_test_python.py | 232 def follows(a, b): function in function:test_foreach_scc
240 list.foreach_scc(follows, add_single)
|
| isl_ast_codegen.c | 4721 int follows; local
4723 follows = isl_set_follows_at(data->domain[i].set,
4726 if (follows < -1)
4728 if (follows > 0)
4730 if (follows < 0)
|
| isl_map.c | 10012 * 1 if bset1 follows bset2
10102 int follows = -1; local
10113 if (f > follows)
10114 follows = f;
10117 return follows;
|
| /src/external/bsd/nsd/dist/simdzone/src/generic/ |
| scanner.h | 82 static inline uint64_t follows(const uint64_t match, uint64_t *overflow) function
188 follows(block->contiguous, &parser->file->state.follows_contiguous);
|
| /src/external/gpl2/gettext/dist/gettext-tools/libgrep/ |
| dfa.h | 318 position_set *follows; /* Array of follow sets, indexed by position member in struct:dfa
|
| dfa.c | 79 /* ISASCIIDIGIT differs from ISDIGIT, as follows:
1147 /* The grammar understood by the parser is as follows.
1583 for (j = 0; j < d->follows[old.index].nelem; ++j)
1585 p.index = d->follows[old.index].elems[j].index;
1692 CALLOC(d->follows, position_set, d->tindex);
1717 merge(&tmp, &d->follows[pos[j].index], &merged);
1718 REALLOC_IF_NECESSARY(d->follows[pos[j].index].elems, position,
1720 copy(&merged, &d->follows[pos[j].index]);
1737 merge(&tmp, &d->follows[pos[j].index], &merged);
1738 REALLOC_IF_NECESSARY(d->follows[pos[j].index].elems, position
1927 position_set follows; \/* Union of the follows of some group. *\/ local
2646 position_set follows; local
[all...] |
| /src/external/gpl2/grep/dist/src/ |
| dfa.h | 337 position_set *follows; /* Array of follow sets, indexed by position member in struct:dfa
|
| dfa.c | 94 /* ISASCIIDIGIT differs from ISDIGIT, as follows:
1168 /* The grammar understood by the parser is as follows.
1604 for (j = 0; j < d->follows[old.index].nelem; ++j)
1606 p.index = d->follows[old.index].elems[j].index;
1713 CALLOC(d->follows, position_set, d->tindex);
1738 merge(&tmp, &d->follows[pos[j].index], &merged);
1739 REALLOC_IF_NECESSARY(d->follows[pos[j].index].elems, position,
1741 copy(&merged, &d->follows[pos[j].index]);
1758 merge(&tmp, &d->follows[pos[j].index], &merged);
1759 REALLOC_IF_NECESSARY(d->follows[pos[j].index].elems, position
1948 position_set follows; \/* Union of the follows of some group. *\/ local
2667 position_set follows; local
[all...] |
| /src/external/gpl2/xcvs/dist/lib/ |
| regexec.c | 3310 re_node_set follows, *dests_node;
3356 err = re_node_set_alloc (&follows, ndests + 1);
3381 re_node_set_free (&follows);
3398 re_node_set_empty (&follows);
3399 /* Merge the follows of this destination states. */
3405 err = re_node_set_merge (&follows, dfa->eclosures + next_node);
3410 dest_states[i] = re_acquire_state_context (&err, dfa, &follows, 0);
3417 dest_states_word[i] = re_acquire_state_context (&err, dfa, &follows,
3425 dest_states_nl[i] = re_acquire_state_context (&err, dfa, &follows,
3516 re_node_set_free (&follows);
3306 re_node_set follows, *dests_node; local
[all...] |
