Searched refs:cur (Results 1 – 5 of 5) sorted by relevance
| /lib/ |
| D | prio_tree.c | 190 struct prio_tree_node *cur, *res = node; in prio_tree_insert() local
201 cur = root->prio_tree_node; in prio_tree_insert()
205 get_index(root, cur, &r_index, &h_index); in prio_tree_insert()
208 return cur; in prio_tree_insert()
213 node = prio_tree_replace(root, cur, node); in prio_tree_insert()
214 cur = tmp; in prio_tree_insert()
230 if (prio_tree_right_empty(cur)) { in prio_tree_insert()
232 cur->right = node; in prio_tree_insert()
233 node->parent = cur; in prio_tree_insert()
236 cur = cur->right; in prio_tree_insert()
[all …]
|
| D | cmdline.c | 54 char *cur = *str; in get_option() local
56 if (!cur || !(*cur)) in get_option()
58 *pint = simple_strtol (cur, str, 0); in get_option()
59 if (cur == *str) in get_option()
|
| D | bitmap.c | 470 int cur, rbot, rtop; in bitmap_scnlistprintf() local
476 rbot = cur = find_first_bit(maskp, nmaskbits); in bitmap_scnlistprintf()
477 while (cur < nmaskbits) { in bitmap_scnlistprintf()
478 rtop = cur; in bitmap_scnlistprintf()
479 cur = find_next_bit(maskp, nmaskbits, cur+1); in bitmap_scnlistprintf()
480 if (cur >= nmaskbits || cur > rtop + 1) { in bitmap_scnlistprintf()
482 rbot = cur; in bitmap_scnlistprintf()
|
| D | ts_fsm.c | 141 struct ts_fsm_token *cur = NULL, *next; in fsm_find() local
170 cur = &fsm->tokens[tok_idx]; in fsm_find()
177 switch (cur->recur) { in fsm_find()
182 if (!match_token(cur, data[block_idx])) in fsm_find()
188 !match_token(cur, data[block_idx])) in fsm_find()
196 if (!match_token(cur, data[block_idx])) in fsm_find()
210 if (!match_token(cur, data[block_idx])) in fsm_find()
233 if (!match_token(cur, data[block_idx])) in fsm_find()
|
| D | kobject.c | 85 int cur = strlen(kobject_name(parent)); in fill_kobj_path() local
87 length -= cur; in fill_kobj_path()
88 strncpy(path + length, kobject_name(parent), cur); in fill_kobj_path()
|