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

  /src/lib/libc/stdlib/
_env.c 103 uintptr_t addr_a, addr_b; local
105 addr_a = (uintptr_t)node_a;
108 if (addr_a < addr_b)
111 if (addr_a > addr_b)
  /src/external/bsd/libpcap/dist/
sockutils.c 403 const struct addr_status *addr_a = (const struct addr_status *)a; local
406 return addr_a->info->ai_family - addr_b->info->ai_family;
415 const struct addr_status *addr_a = (const struct addr_status *)a; local
418 if (addr_a->errtype == addr_b->errtype)
420 if (addr_a->errcode == addr_b->errcode)
422 return addr_a->info->ai_family - addr_b->info->ai_family;
424 return addr_a->errcode - addr_b->errcode;
427 return addr_a->errtype - addr_b->errtype;
  /src/external/gpl2/dtc/dist/
checks.c 1238 const char *addr_a = get_unitname(childa); local
1240 if (!strlen(addr_a))
1254 if (streq(addr_a, addr_b))
  /src/external/gpl3/gcc/dist/gcc/
tree-data-ref.cc 2038 tree addr_a = DR_BASE_ADDRESS (dr_a.dr);
2048 if (!internal_check_ptrs_fn_supported_p (ifn, TREE_TYPE (addr_a),
2052 if (!internal_check_ptrs_fn_supported_p (ifn, TREE_TYPE (addr_a),
2058 addr_a = fold_build_pointer_plus (addr_a, DR_OFFSET (dr_a.dr));
2059 addr_a = fold_build_pointer_plus (addr_a, DR_INIT (dr_a.dr));
2066 4, addr_a, addr_b,
2096 |<- ADDR_A ->| |<- ADDR_B ->|
2435 access of DR_A. In other words, we need to move addr_a along b
2037 tree addr_a = DR_BASE_ADDRESS (dr_a.dr); local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-data-ref.cc 2025 tree addr_a = DR_BASE_ADDRESS (dr_a.dr);
2035 if (!internal_check_ptrs_fn_supported_p (ifn, TREE_TYPE (addr_a),
2039 if (!internal_check_ptrs_fn_supported_p (ifn, TREE_TYPE (addr_a),
2045 addr_a = fold_build_pointer_plus (addr_a, DR_OFFSET (dr_a.dr));
2046 addr_a = fold_build_pointer_plus (addr_a, DR_INIT (dr_a.dr));
2053 4, addr_a, addr_b,
2083 |<- ADDR_A ->| |<- ADDR_B ->|
2422 access of DR_A. In other words, we need to move addr_a along b
2024 tree addr_a = DR_BASE_ADDRESS (dr_a.dr); local
    [all...]

Completed in 32 milliseconds