| /haiku-fatelf/src/bin/gdb/libiberty/ |
| H A D | insque.c | 6 @deftypefn Supplemental void insque (struct qelem *@var{elem}, struct qelem *@var{pred})
11 after @var{pred}. The @code{remque} routine removes @var{elem} from
36 insque (elem, pred)
38 struct qelem *pred;
40 elem -> q_forw = pred -> q_forw;
41 pred -> q_forw -> q_back = elem;
42 elem -> q_back = pred;
43 pred -> q_forw = elem;
|
| /haiku-fatelf/src/libs/stdc++/legacy/ |
| H A D | insque.c | 15 void insque (struct qelem *elem, struct qelem *pred)
33 insque (elem, pred)
35 struct qelem *pred;
37 elem -> q_forw = pred -> q_forw;
38 pred -> q_forw -> q_back = elem;
39 elem -> q_back = pred;
40 pred -> q_forw = elem;
|
| /haiku-fatelf/src/apps/glteapot/ |
| H A D | util.h | 103 LispNode<contents>** pred = &first; local
104 while(*pred)
105 pred = &(*pred)->cdr;
106 *pred = new_element;
130 LispNode< contents >** pred = &first; local
131 while (*pred)
132 pred = &(*pred)->cdr;
134 *pred
[all...] |
| /haiku-fatelf/src/bin/network/tcpdump/libpcap/ |
| H A D | optimize.c | 1221 memcpy((char *)b->val, (char *)p->pred->val, sizeof(b->val));
1232 if (b->val[i] != p->pred->val[i])
1329 aval1 = ep->pred->val[A_ATOM];
1330 oval1 = ep->pred->oval;
1378 if (!use_conflict(ep->pred, ep->succ->et.succ)) {
1404 if (target != 0 && !use_conflict(ep->pred, target)) {
1436 val = ep->pred->val[A_ATOM];
1438 if (val != ep->pred->val[A_ATOM])
1441 if (JT(b->in_edges->pred) == b)
1442 diffp = &JT(b->in_edges->pred);
[all...] |
| H A D | gencode.h | 221 struct block *pred; member in struct:edge
|
| /haiku-fatelf/src/bin/gdb/gdb/ |
| H A D | macrotab.c | 633 splay_tree_node pred = splay_tree_predecessor (t->definitions,
636 if (pred)
640 struct macro_key *found = (struct macro_key *) pred->key;
643 n = pred;
628 splay_tree_node pred = splay_tree_predecessor (t->definitions, local
|
| /haiku-fatelf/src/bin/sharutils/contrib/ |
| H A D | uuencode.pas | 82 else outfilename := copy (infilename, 1, pred(i));
142 for i := 0 to pred(lineLength) do
|
| /haiku-fatelf/src/libs/ncurses/progs/ |
| H A D | dump_entry.c | 508 PredFunc pred,
530 if (pred == 0) {
532 pred = dump_predicate;
554 predval = pred(BOOLEAN, i);
577 predval = pred(NUMBER, i);
673 predval = pred(STRING, i);
906 fmt_entry(tterm, pred, \
919 PredFunc pred)
507 fmt_entry(TERMTYPE *tterm, PredFunc pred, bool content_only, bool suppress_untranslatable, bool infodump, int numbers) argument
914 dump_entry(TERMTYPE *tterm, bool suppress_untranslatable, bool limited, int already_used, int numbers, PredFunc pred) argument
|
| /haiku-fatelf/headers/os/support/ |
| H A D | ObjectList.h | 907 BObjectList<T>::FindBinaryInsertionIndex(const UnaryPredicate<T>& pred, argument
910 int32 index = _PointerList_::BinarySearchIndexByPredicate(&pred,
925 BObjectList<T>::BinaryInsert(T* item, const UnaryPredicate<T>& pred) argument
927 return AddItem(item, FindBinaryInsertionIndex(pred));
933 BObjectList<T>::BinaryInsertUnique(T* item, const UnaryPredicate<T>& pred) argument
936 int32 index = FindBinaryInsertionIndex(pred, &alreadyInList);
|
| /haiku-fatelf/src/bin/findutils/find/ |
| H A D | find.c | 94 static boolean default_prints PARAMS((struct predicate *pred));
2093 default_prints (struct predicate *pred)
2095 while (pred != NULL)
2097 if (pred->no_default_print)
2099 pred = pred->pred_next;
2071 default_prints(struct predicate *pred) argument
|
| H A D | parser.c | 164 static boolean insert_time PARAMS((char **argv, int *arg_ptr, const struct parser_table* entry, PRED_FUNC pred));
854 check_name_arg(const char *pred, const char *arg)
859 pred, arg, arg);
2431 insert_time (char **argv, int *arg_ptr, const struct parser_table* entry, PRED_FUNC pred)
2464 our_pred = insert_primary_withpred (entry, pred);
851 check_name_arg(const char *pred, const char *arg) argument
2423 insert_time(char **argv, int *arg_ptr, const struct parser_table* entry, PRED_FUNC pred) argument
|
| /haiku-fatelf/src/add-ons/translators/webp/libwebp/enc/ |
| H A D | analysis.c | 50 static int CollectHistogram(const uint8_t* ref, const uint8_t* pred, argument
56 VP8FTransform(ref + VP8Scan[j], pred + VP8Scan[j], out);
|
| /haiku-fatelf/src/libs/agg/gpc/ |
| H A D | gpc.c | 183 struct edge_shape *pred; /* Edge connected at the lower end */ member in struct:edge_shape
505 e[i].pred= ((num_edges > 1) && (i > 0)) ? &(e[i - 1]) : NULL;
555 e[i].pred= ((num_edges > 1) && (i > 0)) ? &(e[i - 1]) : NULL;
|
| /haiku-fatelf/src/tools/docbook/libxml2/ |
| H A D | tree.c | 3652 xmlNodePtr pred = NULL; local
3655 pred = root;
3660 root = pred;
|