Searched refs:luid (Results 1 - 10 of 10) sorted by relevance
/freebsd-9.3-release/lib/libc/rpc/ |
H A D | netnamer.c | 81 long luid; local 133 if (sscanf(val, "%ld", &luid) != 1) 135 uid = luid;
|
/freebsd-9.3-release/contrib/gcc/ |
H A D | bt-load.c | 54 int luid; member in struct:btr_user_s 80 int luid; member in struct:btr_def_s 311 this->luid = insn_luid; 362 user->luid = insn_luid; 1176 def->luid = 0; 1324 && user->luid > def->luid 1325 && (def->luid + def_latency) > user->luid 1327 (def->luid [all...] |
H A D | sched-int.h | 279 int luid; member in struct:haifa_insn_data 348 #define INSN_LUID(INSN) (h_i_d[INSN_UID (INSN)].luid)
|
H A D | sched-deps.c | 1779 init_dependency_caches (int luid) 1781 /* ?!? We could save some memory by computing a per-region luid mapping 1787 if (luid / n_basic_blocks > 100 * 5) 1790 extend_dependency_caches (luid, true); 1801 int i, luid = cache_size + n; 1804 luid); 1806 output_dependency_cache, luid); 1808 luid); 1811 forward_dependency_cache, luid); 1815 luid); 1769 init_dependency_caches(int luid) argument 1791 int i, luid = cache_size + n; local [all...] |
H A D | df.h | 260 /* ???? The following luid field should be considered private so that 262 int luid; /* Logical UID. */ member in struct:df_insn_info 467 #define DF_INSN_LUID(DF, INSN) (DF_INSN_GET(DF,INSN)->luid) 472 #define DF_INSN_UID_LUID(DF, INSN) (DF_INSN_UID_GET(DF,INSN)->luid)
|
H A D | df-problems.c | 3072 fprintf (file, "d%d bb %d luid %d insn %d reg %d ", 3095 fprintf (file, "u%d bb %d luid %d insn %d reg %d ", 3424 int flags, int luid) 3449 REG_LIVE_LENGTH (dregno) += luid; 3503 int luid = 0; 3556 luid++; 3607 local_processed, dflow->flags, luid); 3623 local_processed, dflow->flags, luid); 3701 REG_LIVE_LENGTH (regno) += luid; 3414 df_create_unused_note(basic_block bb, rtx insn, struct df_ref *def, bitmap live, bitmap do_not_gen, bitmap artificial_uses, bitmap local_live, bitmap local_processed, int flags, int luid) argument 3496 int luid = 0; local
|
H A D | haifa-sched.c | 2749 static int luid; 2834 h_i_d[0].luid = 0; 2835 luid = 1; 2839 INSN_LUID (insn) = luid; 2841 /* Increment the next luid, unless this is a note. We don't 2847 ++luid; 2853 init_dependency_caches (luid); 3333 INSN_LUID (insn) = luid++; 2744 static int luid; variable
|
H A D | df-scan.c | 1630 int luid = 0; 1653 DF_INSN_LUID (df, insn) = luid++; 1656 DF_INSN_LUID (df, insn) = luid; 1626 int luid = 0; local
|
H A D | see.c | 319 luid number forward order. 377 and luid number forward order. For each reference: 531 /* The luid of the insn. */ 532 unsigned int luid; member in struct:see_ref_s 555 /* The last luid of the reference that defines this register in this basic 558 /* The luid of the reference that has the first extension of this register 561 /* The luid of the reference that has the first extension of this register 625 The splay tree will hold see_ref_s structures. The key is the luid 3110 ref_s->luid = DF_INSN_LUID (df, ref_insn);
|
/freebsd-9.3-release/usr.sbin/sysinstall/ |
H A D | user.c | 408 unsigned long luid; local 422 luid = strtoul(uid, &cp, 10); 423 if (luid == 0 || luid > UID_MAX || (*cp != '\0' && !isspace(*cp))) {
|
Completed in 352 milliseconds