/netbsd-current/external/gpl2/lvm2/dist/daemons/cmirrord/ |
H A D | functions.h | 27 int push_state(const char *uuid, uint64_t luid, 29 int pull_state(const char *uuid, uint64_t luid,
|
H A D | cluster.h | 54 int create_cluster_cpg(char *uuid, uint64_t luid);
|
H A D | functions.c | 66 uint64_t luid; member in struct:log_c 162 static struct log_c *get_log(const char *uuid, uint64_t luid) argument 168 (!luid || (luid == lc->luid))) 182 static struct log_c *get_pending_log(const char *uuid, uint64_t luid) argument 188 (!luid || (luid == lc->luid))) 369 static int _clog_ctr(char *uuid, uint64_t luid, argument 700 cluster_postsuspend(char *uuid, uint64_t luid) argument 1679 push_state(const char *uuid, uint64_t luid, const char *which, char **buf, uint32_t debug_who) argument 1739 pull_state(const char *uuid, uint64_t luid, const char *which, char *buf, int size) argument [all...] |
H A D | cluster.c | 118 uint64_t luid; member in struct:clog_cpg 165 * Once the request heads for the cluster, the luid looses 168 rq->u_rq.luid = 0; 378 new->bitmap_size = push_state(entry->name.value, entry->luid, 388 new->bitmap_size = push_state(entry->name.value, entry->luid, 399 r = push_state(entry->name.value, entry->luid, 728 if (pull_state(entry->name.value, entry->luid, 1259 cluster_postsuspend(match->name.value, match->luid); 1460 int create_cluster_cpg(char *uuid, uint64_t luid) argument 1488 new->luid [all...] |
/netbsd-current/sys/compat/linux32/common/ |
H A D | linux32_uid16.c | 221 linux32_uid16_t luid; local 224 luid = BSDTOLINUX32_UID(buid); 225 if ((error = copyout(&luid, SCARG_P32(uap, ruid), sizeof(luid))) != 0) 229 luid = BSDTOLINUX32_UID(buid); 230 if ((error = copyout(&luid, SCARG_P32(uap, euid), sizeof(luid))) != 0) 234 luid = BSDTOLINUX32_UID(buid); 235 return (copyout(&luid, SCARG_P32(uap, suid), sizeof(luid))); [all...] |
/netbsd-current/external/gpl2/lvm2/dist/include/ |
H A D | dm-log-userspace.h | 377 * The local unique identifier (luid) and the universally unique 380 * just the 'luid', but a cluster-aware log must use the 'uuid' and 381 * the 'luid'. The uuid is what is required for node to node 382 * communication concerning a particular log, but the 'luid' helps 386 uint64_t luid; member in struct:dm_ulog_request
|
/netbsd-current/external/gpl2/lvm2/dist/libdm/misc/ |
H A D | dm-log-userspace.h | 377 * The local unique identifier (luid) and the universally unique 380 * just the 'luid', but a cluster-aware log must use the 'uuid' and 381 * the 'luid'. The uuid is what is required for node to node 382 * communication concerning a particular log, but the 'luid' helps 386 uint64_t luid; member in struct:dm_ulog_request
|
/netbsd-current/sys/compat/linux/common/ |
H A D | linux_uid16.c | 181 linux_uid16_t luid; local 184 luid = BSDTOLINUX_UID(buid); 185 if ((error = copyout(&luid, SCARG(uap, ruid), sizeof(luid))) != 0) 189 luid = BSDTOLINUX_UID(buid); 190 if ((error = copyout(&luid, SCARG(uap, euid), sizeof(luid))) != 0) 194 luid = BSDTOLINUX_UID(buid); 195 return (copyout(&luid, SCARG(uap, suid), sizeof(luid))); [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | auto-inc-dec.c | 1166 int luid = DF_INSN_LUID (inc_insn.insn); local 1186 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1195 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1213 int luid = DF_INSN_LUID (inc_insn.insn); local 1251 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1279 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1287 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1315 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1473 int luid = DF_INSN_LUID (mem_insn.insn); local 1477 if (other_insn && luid > DF_INSN_LUI 1558 int luid = DF_INSN_LUID (reg0_use); local [all...] |
H A D | df.h | 434 int luid; member in struct:df_insn_info 751 #define DF_INSN_INFO_LUID(II) ((II)->luid) 767 #define DF_INSN_UID_LUID(INSN) (DF_INSN_UID_GET (INSN)->luid)
|
H A D | df-scan.c | 1068 int luid; 1083 luid = DF_INSN_LUID (insn); 1086 DF_INSN_LUID (insn) = luid; 3232 int luid = 0; 3248 DF_INSN_INFO_LUID (insn_info) = luid; 3250 luid++; 3324 int luid = 0; 3342 DF_INSN_INFO_LUID (insn_info) = luid++; 3346 DF_INSN_INFO_LUID (insn_info) = luid; 1064 int luid; local 3227 int luid = 0; local 3319 int luid = 0; local
|
H A D | sched-deps.c | 4103 /* ?!? We could save some memory by computing a per-region luid mapping 4130 int i, luid = cache_size + n; 4133 luid); 4135 output_dependency_cache, luid); 4137 luid); 4139 luid); 4143 luid); 4145 for (i = cache_size; i < luid; i++) 4155 cache_size = luid; 4120 int i, luid = cache_size + n; local
|
H A D | df-problems.c | 1438 int luid = 0; 1453 DF_INSN_INFO_LUID (insn_info) = luid; 1457 luid++; 1961 int luid = 0; 1981 DF_INSN_INFO_LUID (insn_info) = luid; 1985 luid++; 2624 fprintf (file, ";; UD chains for insn luid %d uid %d\n", 2654 fprintf (file, ";; DU chains for insn luid %d uid %d\n", 1435 int luid = 0; local 1957 int luid = 0; local
|
H A D | gcse.c | 1455 int luid = DF_INSN_LUID (insn); 1457 info->last_set = luid; 1461 info->first_set = luid; 1446 int luid = DF_INSN_LUID (insn); local
|
H A D | sched-int.h | 76 -1 - if this rtx don't need a luid. 77 0 - if it should have the same luid as the previous insn. 78 1 - if it needs a separate luid. */ 107 structures should be indexed by luid. */ 842 int luid; 841 int luid; member in struct:_haifa_insn_data
|
H A D | haifa-sched.c | 8994 int luid; 8998 luid = sched_max_luid; 9002 luid = -1; 9004 SET_INSN_LUID (insn, luid); 8978 int luid; local
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | auto-inc-dec.cc | 1166 int luid = DF_INSN_LUID (inc_insn.insn); local 1186 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1195 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1213 int luid = DF_INSN_LUID (inc_insn.insn); local 1251 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1279 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1287 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1315 if (other_insn && luid > DF_INSN_LUID (other_insn)) 1473 int luid = DF_INSN_LUID (mem_insn.insn); local 1477 if (other_insn && luid > DF_INSN_LUI 1558 int luid = DF_INSN_LUID (reg0_use); local [all...] |
H A D | df.h | 434 int luid; member in struct:df_insn_info 751 #define DF_INSN_INFO_LUID(II) ((II)->luid) 767 #define DF_INSN_UID_LUID(INSN) (DF_INSN_UID_GET (INSN)->luid)
|
H A D | df-scan.cc | 1068 int luid; 1083 luid = DF_INSN_LUID (insn); 1086 DF_INSN_LUID (insn) = luid; 3246 int luid = 0; 3262 DF_INSN_INFO_LUID (insn_info) = luid; 3264 luid++; 3338 int luid = 0; 3356 DF_INSN_INFO_LUID (insn_info) = luid++; 3360 DF_INSN_INFO_LUID (insn_info) = luid; 1064 int luid; local
|
H A D | sched-deps.cc | 4086 /* ?!? We could save some memory by computing a per-region luid mapping 4113 int i, luid = cache_size + n; 4116 luid); 4118 output_dependency_cache, luid); 4120 luid); 4122 luid); 4126 luid); 4128 for (i = cache_size; i < luid; i++) 4138 cache_size = luid; 4103 int i, luid = cache_size + n; local
|
H A D | df-problems.cc | 1478 int luid = 0; 1493 DF_INSN_INFO_LUID (insn_info) = luid; 1497 luid++; 2001 int luid = 0; 2021 DF_INSN_INFO_LUID (insn_info) = luid; 2025 luid++; 2664 fprintf (file, ";; UD chains for insn luid %d uid %d\n", 2694 fprintf (file, ";; DU chains for insn luid %d uid %d\n", 1475 int luid = 0; local 1997 int luid = 0; local
|
H A D | gcse.cc | 1454 int luid = DF_INSN_LUID (insn); 1456 info->last_set = luid; 1460 info->first_set = luid; 1445 int luid = DF_INSN_LUID (insn); local
|
H A D | sched-int.h | 76 -1 - if this rtx don't need a luid. 77 0 - if it should have the same luid as the previous insn. 78 1 - if it needs a separate luid. */ 107 structures should be indexed by luid. */ 842 int luid; 841 int luid; member in struct:_haifa_insn_data
|
/netbsd-current/external/mit/libuv/dist/src/win/ |
H A D | getaddrinfo.c | 400 NET_LUID luid; local 408 r = ConvertInterfaceIndexToLuid(ifindex, &luid); 413 r = ConvertInterfaceLuidToNameW(&luid, wname, ARRAY_SIZE(wname));
|
/netbsd-current/external/gpl3/binutils/dist/gprofng/libcollector/ |
H A D | unwind.c | 810 uint64_t luid = suid; /* link uid */ local 825 luid = uidt; 830 if (luid) 833 for (int i = 0; i<sizeof (luid); i++) 835 *d++ = (char) luid; 836 luid = luid >> 8;
|