HomeSort by: relevance | last modified time | path
    Searched defs:nexts (Results 1 - 20 of 20) sorted by relevancy

  /src/external/bsd/openldap/dist/clients/tools/
ldapurl.c 179 int nexts = 0; local
294 sizeof( char * ) * ( nexts + 2 ) );
295 lud.lud_exts[ nexts++ ] = optarg;
296 lud.lud_exts[ nexts ] = NULL;
ldapurl.c 179 int nexts = 0; local
294 sizeof( char * ) * ( nexts + 2 ) );
295 lud.lud_exts[ nexts++ ] = optarg;
296 lud.lud_exts[ nexts ] = NULL;
  /src/external/gpl3/binutils/dist/gprofng/src/
Filter.cc 214 char *nexts = s; local
220 if (*nexts == '-')
225 val = get_next_number (s, &nexts, error);
231 switch (*nexts)
234 s = ++nexts;
240 s = ++nexts;
241 if (*nexts == ',' || *nexts == '\0')
245 val2 = get_next_number (s, &nexts, error);
264 if (*nexts == ','
    [all...]
Filter.cc 214 char *nexts = s; local
220 if (*nexts == '-')
225 val = get_next_number (s, &nexts, error);
231 switch (*nexts)
234 s = ++nexts;
240 s = ++nexts;
241 if (*nexts == ',' || *nexts == '\0')
245 val2 = get_next_number (s, &nexts, error);
264 if (*nexts == ','
    [all...]
  /src/external/gpl3/binutils.old/dist/gprofng/src/
Filter.cc 214 char *nexts = s; local
220 if (*nexts == '-')
225 val = get_next_number (s, &nexts, error);
231 switch (*nexts)
234 s = ++nexts;
240 s = ++nexts;
241 if (*nexts == ',' || *nexts == '\0')
245 val2 = get_next_number (s, &nexts, error);
264 if (*nexts == ','
    [all...]
Filter.cc 214 char *nexts = s; local
220 if (*nexts == '-')
225 val = get_next_number (s, &nexts, error);
231 switch (*nexts)
234 s = ++nexts;
240 s = ++nexts;
241 if (*nexts == ',' || *nexts == '\0')
245 val2 = get_next_number (s, &nexts, error);
264 if (*nexts == ','
    [all...]
  /src/sys/dist/pf/net/
if_pfsync.c 430 struct pf_state *nexts; local
445 st; st = nexts) {
446 nexts = RB_NEXT(pf_state_tree_id, &tree_id, st);
if_pfsync.c 430 struct pf_state *nexts; local
445 st; st = nexts) {
446 nexts = RB_NEXT(pf_state_tree_id, &tree_id, st);
pf_ioctl.c 1870 struct pf_state *ps, *nexts; local
1874 for (ps = RB_MIN(pf_state_tree_id, &tree_id); ps; ps = nexts) {
1875 nexts = RB_NEXT(pf_state_tree_id, &tree_id, ps);
1895 struct pf_state *ps, *nexts; local
1902 ps = nexts) {
1903 nexts = RB_NEXT(pf_state_tree_id, &tree_id, ps);
pf_ioctl.c 1870 struct pf_state *ps, *nexts; local
1874 for (ps = RB_MIN(pf_state_tree_id, &tree_id); ps; ps = nexts) {
1875 nexts = RB_NEXT(pf_state_tree_id, &tree_id, ps);
1895 struct pf_state *ps, *nexts; local
1902 ps = nexts) {
1903 nexts = RB_NEXT(pf_state_tree_id, &tree_id, ps);
  /src/external/gpl3/binutils/dist/gas/
dwarf2dbg.c 811 struct line_seg *s, *nexts;
813 for (s = all_segs; s; s = nexts)
836 nexts = s->next;
810 struct line_seg *s, *nexts; local
dwarf2dbg.c 811 struct line_seg *s, *nexts;
813 for (s = all_segs; s; s = nexts)
836 nexts = s->next;
810 struct line_seg *s, *nexts; local
  /src/external/gpl3/binutils/dist/ld/
ldelf.c 2158 asection *nexts; local
2308 nexts = s;
2309 while ((nexts = bfd_get_next_section_by_name (nexts->owner, nexts))
2311 if (nexts->output_section == NULL
2312 && (nexts->flags & SEC_EXCLUDE) == 0
2313 && ((nexts->flags ^ flags) & (SEC_LOAD | SEC_ALLOC)) == 0
2314 && (nexts->owner->flags & DYNAMIC) == 0
2315 && !bfd_input_just_syms (nexts->owner
    [all...]
ldelf.c 2158 asection *nexts; local
2308 nexts = s;
2309 while ((nexts = bfd_get_next_section_by_name (nexts->owner, nexts))
2311 if (nexts->output_section == NULL
2312 && (nexts->flags & SEC_EXCLUDE) == 0
2313 && ((nexts->flags ^ flags) & (SEC_LOAD | SEC_ALLOC)) == 0
2314 && (nexts->owner->flags & DYNAMIC) == 0
2315 && !bfd_input_just_syms (nexts->owner
    [all...]
  /src/external/gpl3/binutils.old/dist/gas/
dwarf2dbg.c 811 struct line_seg *s, *nexts;
813 for (s = all_segs; s; s = nexts)
836 nexts = s->next;
810 struct line_seg *s, *nexts; local
dwarf2dbg.c 811 struct line_seg *s, *nexts;
813 for (s = all_segs; s; s = nexts)
836 nexts = s->next;
810 struct line_seg *s, *nexts; local
  /src/external/gpl3/binutils.old/dist/ld/
ldelf.c 2159 asection *nexts; local
2309 nexts = s;
2310 while ((nexts = bfd_get_next_section_by_name (nexts->owner, nexts))
2312 if (nexts->output_section == NULL
2313 && (nexts->flags & SEC_EXCLUDE) == 0
2314 && ((nexts->flags ^ flags) & (SEC_LOAD | SEC_ALLOC)) == 0
2315 && (nexts->owner->flags & DYNAMIC) == 0
2316 && !bfd_input_just_syms (nexts->owner
    [all...]
ldelf.c 2159 asection *nexts; local
2309 nexts = s;
2310 while ((nexts = bfd_get_next_section_by_name (nexts->owner, nexts))
2312 if (nexts->output_section == NULL
2313 && (nexts->flags & SEC_EXCLUDE) == 0
2314 && ((nexts->flags ^ flags) & (SEC_LOAD | SEC_ALLOC)) == 0
2315 && (nexts->owner->flags & DYNAMIC) == 0
2316 && !bfd_input_just_syms (nexts->owner
    [all...]
  /src/external/gpl2/xcvs/dist/lib/
regex_internal.h 716 Idx *nexts; member in struct:re_dfa_t
regex_internal.h 716 Idx *nexts; member in struct:re_dfa_t

Completed in 76 milliseconds