Searched refs:s_next (Results 1 - 14 of 14) sorted by relevance
| /macosx-10.10/dtrace-147/libelf/ |
| H A D | nextscn.c | 45 ret_scn = scn->s_next;
54 ret_scn = scn->s_next;
|
| H A D | newscn.c | 81 elf->ed_tlscn = tl->s_next = &s->sb_scn;
111 elf->ed_tlscn = tl->s_next = &s->sb_scn;
|
| H A D | getscn.c | 77 for (prev_s = 0; s != 0; prev_s = s, s = s->s_next) {
|
| H A D | update.c | 210 s = s->s_next;
219 for (; s != 0; s = s->s_next) {
396 s = s->s_next;
398 for (; s != 0; s = s->s_next) {
572 for (s = elf->ed_hdscn; s != 0; s = s->s_next) {
656 for (s = elf->ed_hdscn; s != 0; s = s->s_next) {
890 for (s = elf->ed_hdscn; s != 0; s = s->s_next) {
925 for (s = elf->ed_hdscn; s != 0; s = s->s_next) {
|
| H A D | end.c | 58 for (s = elf->ed_hdscn; s != 0; s = s->s_next) {
|
| H A D | clscook.c | 231 s->s_next = s + 1;
246 s->s_next = 0;
|
| H A D | decl.h | 175 * The caller must first follow the s_next list to the next freeable
176 * node, because free can clobber the s_next value in the block.
182 Elf_Scn *s_next; /* next section */ member in struct:Elf_Scn
|
| /macosx-10.10/apr-32/apr-util/apr-util/strmatch/ |
| H A D | apr_strmatch.c | 40 const char *s_next = s + this_pattern->length - 1; local
43 while (s_next < s_end) {
44 const char *s_tmp = s_next;
53 s_next += shift[(int)*((const unsigned char *)s_next)];
64 const char *s_next = s + this_pattern->length - 1; local
67 while (s_next < s_end) {
68 const char *s_tmp = s_next;
77 s_next += shift[(unsigned char)apr_tolower(*s_next)];
[all...] |
| /macosx-10.10/emacs-93/emacs/oldXMenu/ |
| H A D | DelPane.c | 26 register XMSelect *s_next; /* Pointer to next selection to be deleted. */ local
53 s_ptr = s_next
56 s_next = s_ptr->next;
|
| H A D | Destroy.c | 25 register XMSelect *s_next; /* Pointer to the next selection. */ local
39 s_ptr = s_next
41 s_next = s_ptr->next;
|
| /macosx-10.10/bc-21/bc/bc/ |
| H A D | bcdefs.h | 149 struct estack_rec *s_next; member in struct:estack_rec
154 struct fstack_rec *s_next; member in struct:fstack_rec
|
| H A D | execute.c | 109 temp = temp->s_next;
343 ex_stack->s_num = ex_stack->s_next->s_num;
344 ex_stack->s_next->s_num = temp;
364 c_code = !bc_is_zero (ex_stack->s_next->s_num)
374 c_code = !bc_is_zero (ex_stack->s_next->s_num)
384 bc_add (ex_stack->s_next->s_num, ex_stack->s_num, &temp_num, 0);
395 bc_sub (ex_stack->s_next->s_num, ex_stack->s_num, &temp_num, 0);
406 bc_multiply (ex_stack->s_next->s_num, ex_stack->s_num,
418 if (bc_divide (ex_stack->s_next->s_num,
438 bc_modulo (ex_stack->s_next
[all...] |
| H A D | storage.c | 232 fn_stack = temp->s_next;
254 temp->s_next = fn_stack;
270 ex_stack = temp->s_next;
287 temp->s_next = ex_stack;
302 temp->s_next = ex_stack;
320 temp = temp->s_next;
580 index = bc_num2long (ex_stack->s_next->s_num);
582 (index == 0 && !bc_is_zero(ex_stack->s_next->s_num)))
591 bc_free_num (&ex_stack->s_next->s_num);
592 ex_stack->s_next
[all...] |
| /macosx-10.10/OpenLDAP-499.27/OpenLDAP/servers/slapd/overlays/ |
| H A D | syncprov.c | 50 struct syncres *s_next; member in struct:syncres
62 struct syncops *s_next; member in struct:syncops
818 srnext = sr->s_next;
924 so->s_res = sr->s_next;
1048 sr->s_next = NULL;
1080 so->s_restail->s_next = sr;
1133 soprev=so, so=so->s_next ) {
1137 soprev->s_next = so->s_next;
1242 snext = ss->s_next;
[all...] |
Completed in 256 milliseconds