val 20 include/hash.h } val; /**<ハッシュ値の元データ */ val 5 src/cmem.c long val = strtol(str, &endptr, 10); val 12 src/cmem.c } else if(val < min || max < val) { val 20 src/cmem.c return val; val 93 src/exec.c long val = str2l_range(str, 1, LONG_MAX, "Clock"); val 94 src/exec.c if(val > MAX_CLOCKS) { val 95 src/exec.c val = MAX_CLOCKS; val 96 src/exec.c fprintf(stderr, "Info - %s: Clock frequency exceeds maximum. Set to %ld\n", str, val); val 98 src/exec.c return (CLOCK)val; val 260 src/exec.c void adda(WORD r, WORD val) val 267 src/exec.c if((tmp = (short)(sys->cpu->gr[r]) + (short)val) > 32767 || tmp < -32768) { val 307 src/exec.c void addl_gr(WORD r, WORD val, bool add) val 316 src/exec.c s = o + val; val 321 src/exec.c if(o < val) { val 324 src/exec.c s = o + (~val + 1); val 409 src/exec.c void cpa(WORD r, WORD val) val 412 src/exec.c if((short)sys->cpu->gr[r] < (short)val) { val 414 src/exec.c } else if(sys->cpu->gr[r] == val) { val 433 src/exec.c void cpl(WORD r, WORD val) val 436 src/exec.c if(sys->cpu->gr[r] < val) { val 438 src/exec.c } else if(sys->cpu->gr[r] == val) { val 13 src/hash.c for(int j = 0; keyv[i]->val.s[j]; j++) { val 14 src/hash.c hashval = keyv[i]->val.s[j] + HASHNUM * hashval; val 18 src/hash.c hashval = keyv[i]->val.i + HASHNUM * hashval; val 56 src/label.c key->val.s = strdup_chk(value, "label_hashkey->value"); val 72 src/label.c FREE(keys[j]->val.s); val 23 src/monitor.c key[0]->val.i = adr; val 107 src/struct.c keys[0]->val.s = strdup_chk(cmd, "keys[0].val.s"); val 111 src/struct.c keys[1]->val.i = (int)(type & 070); val 114 src/struct.c FREE(keys[0]->val.s); val 190 src/struct.c keys[0]->val.i = (int)(code >> 8); val 16 test/unit/hash/cmd.c keys[i]->val.s = strdup(str[i]); val 31 test/unit/hash/cmd.c keys[i]->val.i = num[i]; val 47 test/unit/hash/cmd.c keys[cnt++]->val.s = strdup(str[i]); val 52 test/unit/hash/cmd.c keys[cnt++]->val.i = num[i];