| /src/sys/compat/linux32/common/ |
| 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...] |
| /src/sys/compat/linux/common/ |
| 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...] |
| /src/external/gpl2/lvm2/dist/include/ |
| 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
|
| /src/external/gpl2/lvm2/dist/libdm/misc/ |
| 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
|
| /src/external/mit/libuv/dist/src/win/ |
| getaddrinfo.c | 350 NET_LUID luid; local
357 r = ConvertInterfaceIndexToLuid(ifindex, &luid);
362 r = ConvertInterfaceLuidToNameW(&luid, wname, ARRAY_SIZE(wname));
|
| /src/external/gpl2/lvm2/dist/daemons/cmirrord/ |
| 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)
1488 new->luid = luid
[all...] |
| functions.c | 66 uint64_t luid; member in struct:log_c
162 static struct log_c *get_log(const char *uuid, uint64_t luid)
168 (!luid || (luid == lc->luid)))
182 static struct log_c *get_pending_log(const char *uuid, uint64_t luid)
188 (!luid || (luid == lc->luid)))
369 static int _clog_ctr(char *uuid, uint64_t luid,
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| 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_LUID (other_insn)
1558 int luid = DF_INSN_LUID (reg0_use); local
[all...] |
| df-scan.cc | 1068 int luid;
1082 Since the insn isn't moved, we can salvage its LUID. */
1083 luid = DF_INSN_LUID (insn);
1086 DF_INSN_LUID (insn) = luid;
3250 int luid = 0;
3266 DF_INSN_INFO_LUID (insn_info) = luid;
3268 luid++;
3342 int luid = 0;
3360 DF_INSN_INFO_LUID (insn_info) = luid++;
3364 DF_INSN_INFO_LUID (insn_info) = luid;
1064 int luid; local
[all...] |
| 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
|
| gcse.cc | 1021 in block BB before or after the insn with the LUID in UID_LIMIT.
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
|
| sched-deps.cc | 4117 /* ?!? We could save some memory by computing a per-region luid mapping
4144 int i, luid = cache_size + n;
4147 luid);
4149 output_dependency_cache, luid);
4151 luid);
4153 luid);
4157 luid);
4159 for (i = cache_size; i < luid; i++)
4169 cache_size = luid;
4134 int i, luid = cache_size + n; local
|
| 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)
|
| 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. */
112 #define SET_INSN_LUID(INSN, LUID) \
113 (sched_luids[INSN_UID (INSN)] = (LUID))
844 int luid;
987 #define CANT_MOVE_BY_LUID(LUID) (h_d_i_d[LUID].cant_move)
843 int luid; member in struct:_haifa_insn_data
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| 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_LUID (other_insn)
1558 int luid = DF_INSN_LUID (reg0_use); local
[all...] |
| df-scan.cc | 1068 int luid;
1082 Since the insn isn't moved, we can salvage its 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
[all...] |
| 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
|
| gcse.cc | 1020 in block BB before or after the insn with the LUID in UID_LIMIT.
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
|
| 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
|
| 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)
|
| 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. */
112 #define SET_INSN_LUID(INSN, LUID) \
113 (sched_luids[INSN_UID (INSN)] = (LUID))
842 int luid;
985 #define CANT_MOVE_BY_LUID(LUID) (h_d_i_d[LUID].cant_move)
841 int luid; member in struct:_haifa_insn_data
|
| /src/external/gpl3/binutils/dist/gprofng/libcollector/ |
| unwind.c | 821 uint64_t luid = suid; /* link uid */ local
836 luid = uidt;
841 if (luid)
844 for (int i = 0; i<sizeof (luid); i++)
846 *d++ = (char) luid;
847 luid = luid >> 8;
|
| /src/external/gpl3/binutils.old/dist/gprofng/libcollector/ |
| unwind.c | 821 uint64_t luid = suid; /* link uid */ local
836 luid = uidt;
841 if (luid)
844 for (int i = 0; i<sizeof (luid); i++)
846 *d++ = (char) luid;
847 luid = luid >> 8;
|
