HomeSort by: relevance | last modified time | path
    Searched refs:pos1 (Results 1 - 25 of 42) sorted by relevancy

1 2

  /src/external/bsd/tre/dist/tests/
test-str-source.c 58 str_handler_compare(size_t pos1, size_t pos2, size_t len, void *context)
62 (unsigned long)pos1, (unsigned long)pos1 + len,
64 return strncmp(ctx->str + pos1, ctx->str + pos2, len);
  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-alias.h 185 /* Return true, if the two ranges [POS1, SIZE1] and [POS2, SIZE2]
190 ranges_overlap_p (HOST_WIDE_INT pos1,
197 if (pos1 >= pos2
199 || pos1 < (pos2 + (HOST_WIDE_INT) size2)))
201 if (pos2 >= pos1
203 || pos2 < (pos1 + (HOST_WIDE_INT) size1)))
genrecog.cc 300 /* Compare positions POS1 and POS2 lexicographically. */
303 compare_positions (struct position *pos1, struct position *pos2)
307 diff = pos1->depth - pos2->depth;
311 while (pos1->depth != pos2->depth);
314 pos1 = pos1->base;
315 while (pos1->depth != pos2->depth);
316 while (pos1 != pos2)
318 diff = (int) pos1->type - (int) pos2->type;
320 diff = pos1->arg - pos2->arg
    [all...]
poly-int.h 2546 /* Return true if the two ranges [POS1, POS1 + SIZE1) and [POS2, POS2 + SIZE2)
2552 ranges_maybe_overlap_p (const T1 &pos1, const T2 &size1,
2555 if (maybe_in_range_p (pos2, pos1, size1))
2557 if (maybe_in_range_p (pos1, pos2, size2))
2562 /* Return true if the two ranges [POS1, POS1 + SIZE1) and [POS2, POS2 + SIZE2)
2568 ranges_known_overlap_p (const T1 &pos1, const T2 &size1,
2574 /* known_gt (POS1 + SIZE1, POS2) [infinite precision]
2575 --> known_gt (SIZE1, POS2 - POS1) [infinite precision
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-alias.h 185 /* Return true, if the two ranges [POS1, SIZE1] and [POS2, SIZE2]
190 ranges_overlap_p (HOST_WIDE_INT pos1,
197 if (pos1 >= pos2
199 || pos1 < (pos2 + (HOST_WIDE_INT) size2)))
201 if (pos2 >= pos1
203 || pos2 < (pos1 + (HOST_WIDE_INT) size1)))
genrecog.cc 300 /* Compare positions POS1 and POS2 lexicographically. */
303 compare_positions (struct position *pos1, struct position *pos2)
307 diff = pos1->depth - pos2->depth;
311 while (pos1->depth != pos2->depth);
314 pos1 = pos1->base;
315 while (pos1->depth != pos2->depth);
316 while (pos1 != pos2)
318 diff = (int) pos1->type - (int) pos2->type;
320 diff = pos1->arg - pos2->arg
    [all...]
poly-int.h 2610 /* Return true if the two ranges [POS1, POS1 + SIZE1) and [POS2, POS2 + SIZE2)
2616 ranges_maybe_overlap_p (const T1 &pos1, const T2 &size1,
2619 if (maybe_in_range_p (pos2, pos1, size1))
2621 if (maybe_in_range_p (pos1, pos2, size2))
2626 /* Return true if the two ranges [POS1, POS1 + SIZE1) and [POS2, POS2 + SIZE2)
2632 ranges_known_overlap_p (const T1 &pos1, const T2 &size1,
2638 /* known_gt (POS1 + SIZE1, POS2) [infinite precision]
2639 --> known_gt (SIZE1, POS2 - POS1) [infinite precision
    [all...]
  /src/external/bsd/atf/dist/atf-c++/detail/
text.cpp 112 std::string::size_type pos1 = str.find_first_not_of(" \t"); local
115 if (pos1 == std::string::npos && pos2 == std::string::npos)
117 else if (pos1 == std::string::npos)
120 return str.substr(pos1);
122 return str.substr(pos1, pos2 - pos1 + 1);
  /src/external/bsd/atf/dist/tools/
text.cpp 107 std::string::size_type pos1 = str.find_first_not_of(" \t"); local
110 if (pos1 == std::string::npos && pos2 == std::string::npos)
112 else if (pos1 == std::string::npos)
115 return str.substr(pos1);
117 return str.substr(pos1, pos2 - pos1 + 1);
  /src/external/gpl2/gettext/dist/gettext-tools/src/
msgl-equal.c 111 pos_equal (const lex_pos_ty *pos1, const lex_pos_ty *pos2)
113 return ((pos1->file_name == pos2->file_name
114 || strcmp (pos1->file_name, pos2->file_name) == 0)
115 && pos1->line_number == pos2->line_number);
  /src/external/gpl3/gdb/dist/readline/readline/
mbutil.c 397 _rl_compare_chars (char *buf1, int pos1, mbstate_t *ps1, char *buf2, int pos2, mbstate_t *ps2)
401 if ((w1 = _rl_get_char_len (&buf1[pos1], ps1)) <= 0 ||
404 (buf1[pos1] != buf2[pos2]))
408 if (buf1[pos1+i] != buf2[pos2+i])
  /src/external/gpl3/gdb.old/dist/readline/readline/
mbutil.c 397 _rl_compare_chars (char *buf1, int pos1, mbstate_t *ps1, char *buf2, int pos2, mbstate_t *ps2)
401 if ((w1 = _rl_get_char_len (&buf1[pos1], ps1)) <= 0 ||
404 (buf1[pos1] != buf2[pos2]))
408 if (buf1[pos1+i] != buf2[pos2+i])
  /src/external/cddl/osnet/dist/uts/common/sys/
bitmap.h 155 extern int bt_range(ulong_t *bitmap, size_t *pos1, size_t *pos2,
  /src/external/bsd/tre/dist/include/tre/
tre.h 236 int (*compare)(size_t pos1, size_t pos2, size_t len, void *context);
  /src/external/mit/isl/dist/include/isl/
map.h 517 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2);
519 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2);
521 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2);
523 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2);
525 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2);
527 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2);
529 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2);
531 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2);
533 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2);
list.h 56 __isl_take isl_##EL##_list *list, unsigned pos1, \
  /src/external/gpl2/texinfo/dist/util/
texindex.c 120 long int length1, long int pos1, char *start2,
444 POS1 and POS2 should indicate the nominal positional ordering of
448 compare_general (char *str1, char *str2, long int pos1, long int pos2, int use_keyfields)
461 int tem = compare_field (&keyfields[i], start1, length1, pos1,
662 long int pos1, char *start2, long int length2, long int pos2)
666 if (pos1 > pos2)
  /src/external/bsd/tre/dist/lib/
tre.h 267 int (*compare)(size_t pos1, size_t pos2, size_t len, void *context);
  /src/external/mit/isl/dist/
isl_list_templ.c 357 /* Swap the elements of "list" in positions "pos1" and "pos2".
360 unsigned pos1, unsigned pos2)
364 if (pos1 == pos2)
366 el1 = FN(FN(LIST(EL),take),EL_BASE)(list, pos1);
368 list = FN(FN(LIST(EL),restore),EL_BASE)(list, pos1, el2);
isl_map.c 1078 int pos1; local
1092 pos1 = isl_seq_first_non_zero(bset->eq[i] + 1 + nparam, d);
1093 if (pos1 == -1)
1095 if (isl_seq_first_non_zero(bset->eq[i] + 1 + nparam + pos1 + 1,
1096 d - pos1 - 1) != -1)
1105 if (!isl_int_is_one(bset->eq[i][1 + nparam + pos1]) &&
1106 !isl_int_is_negone(bset->eq[i][1 + nparam + pos1]))
13314 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2)
13316 return isl_map_equate(set, type1, pos1, type2, pos2);
13322 enum isl_dim_type type1, int pos1, enum isl_dim_type type2, int pos2
    [all...]
  /src/external/mpl/bind/dist/tests/dns/
name_test.c 817 unsigned int pos1; member in struct:__anon24207
846 dns_name_getlabel(n1, testcases[i].pos1, &l1);
860 unsigned int pos1; member in struct:__anon24208
894 dns_name_getlabelsequence(n1, testcases[i].pos1,
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
searching.d 2935 immutable pos1 = haystack.length - balance.length;
2936 immutable pos2 = balance.empty ? pos1 : pos1 + needle.length;
2937 return Result!(typeof(haystack[0 .. pos1]),
2938 typeof(haystack[pos2 .. haystack.length]))(haystack[0 .. pos1],
2939 haystack[pos1 .. pos2],
2948 size_t pos1, pos2;
2962 pos2 = ++pos1;
2967 pos1 = pos2;
2969 return Result!(typeof(takeExactly(original, pos1)),
    [all...]
  /src/external/bsd/wpa/dist/wpa_supplicant/
ctrl_iface.c 11602 char *pos1, *pos; local
11630 pos1 = os_strstr(cmd, "scs_id=");
11631 if (!pos1) {
11638 while (pos1) {
11646 desc_elem.scs_id = atoi(pos1 + 7);
11647 pos1 += 7;
11649 next_scs_desc = os_strstr(pos1, "scs_id=");
11661 pos1[next_scs_desc - pos1 - 1] = '\0';
11672 if (os_strstr(pos1, "add "))
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/radeon/
radeon_rs600.c 76 u32 pos1, pos2; local
78 pos1 = RREG32(AVIVO_D1CRTC_STATUS_POSITION + crtc_offsets[crtc]);
81 if (pos1 != pos2)
  /src/sys/external/bsd/compiler_rt/dist/include/sanitizer/
linux_syscall_hooks.h 988 #define __sanitizer_syscall_pre_pread64(fd, buf, count, pos0, pos1) \
990 (long)(pos0), (long)(pos1))
991 #define __sanitizer_syscall_post_pread64(res, fd, buf, count, pos0, pos1) \
994 (long)(pos1))
995 #define __sanitizer_syscall_pre_pwrite64(fd, buf, count, pos0, pos1) \
997 (long)(fd), (long)(buf), (long)(count), (long)(pos0), (long)(pos1))
998 #define __sanitizer_syscall_post_pwrite64(res, fd, buf, count, pos0, pos1) \
1000 res, (long)(fd), (long)(buf), (long)(count), (long)(pos0), (long)(pos1))
2560 long pos0, long pos1);
2562 long count, long pos0, long pos1);
    [all...]

Completed in 95 milliseconds

1 2