HomeSort by: relevance | last modified time | path
    Searched refs:num (Results 1 - 25 of 1013) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/tests/usr.bin/xlint/lint1/
msg_170.c 13 /* expect+1: warning: parameter 'num' unused in function 'example' [231] */
14 example(const struct number *num)
18 return *num ? 1 : 0;
msg_206.c 13 test(enum number num)
15 switch (num) {
22 switch (num) {
31 too_many(enum number num)
33 switch (num) {
d_decl_old_style_arguments.c 13 /* expect+4: warning: parameter 'num' unused in function 'func' [231] */
17 void func(num, ptr, dbl, def)
18 int num;
msg_181.c 20 } num = (struct number){ variable in typeref:struct:number
  /src/sys/arch/evbarm/mpcsa/
mpcsa_leds_var.h 8 void mpcsa_blink_led(int num, int interval);
9 void mpcsa_comm_led(int num, int count);
10 void mpcsa_conn_led(int num, int ok);
  /src/lib/libc/string/
strerror_ss.c 47 strerror_r_ss(int num, char *buf, size_t len)
49 if (num >= 0 || num < sys_nerr)
50 strlcpy(buf, sys_errlist[num], len);
52 snprintf_ss(buf, len, "Unknown error %d", num);
57 strerror_ss(int num)
61 strerror_r_ss(num, buf, sizeof(buf));
  /src/sys/lib/libunwind/
Registers.hpp 44 static int dwarf2regno(int num) { return num; }
46 bool validRegister(int num) const {
47 return num >= REGNO_X86_EAX && num <= REGNO_X86_EDI;
50 uint32_t getRegister(int num) const {
51 assert(validRegister(num));
52 return reg[num];
55 void setRegister(int num, uint32_t value) {
56 assert(validRegister(num));
    [all...]
  /src/sys/arch/x86/include/
i8259.h 82 #define IRQ_BIT(num) (1 << ((num) % 8))
83 #define IRQ_BYTE(num) ((num) >> 3)
85 #define i8259_late_ack(num)
89 #define i8259_asm_ack1(num)
90 #define i8259_asm_ack2(num) \
93 #define i8259_asm_mask(num)
94 #define i8259_asm_unmask(num) \
95 movb $(0x60|(num%8)),%al /* specific EOI */ ;
    [all...]
  /src/distrib/utils/libhack/
strerror.c 41 strerror(num)
42 int num;
46 errnum = num; /* convert to unsigned */
strsignal.c 51 strsignal(num)
52 int num;
56 signum = num; /* convert to unsigned */
  /src/lib/libc/db/hash/
hash_log2.c 50 __log2(uint32_t num)
54 if (num == 0)
56 --num;
59 for (i = 0; limit < num; limit = limit * 2 + 1, i++)
  /src/lib/libc/stdlib/
div.c 47 div(int num, int denom)
51 r.quot = num / denom;
52 r.rem = num % denom;
63 * sign of num; if both are negative and r.quot has been
65 * have the opposite sign of num). These are considered
68 * If both are num and denom are positive, r will always
72 * if num >= 0, but r.rem < 0, we got the wrong answer.
76 if (num >= 0 && r.rem < 0) {
ldiv.c 47 ldiv(long num, long denom)
53 r.quot = num / denom;
54 r.rem = num % denom;
55 if (num >= 0 && r.rem < 0) {
strsuftoll.c 140 long long num, t; local in function:__strsuftollx
156 num = strtoll(val, &expr, 10);
165 t = num;
166 num *= 512; /* 1 block */
167 if (t > num)
172 t = num;
173 num *= 1024; /* 1 kibibyte */
174 if (t > num)
179 t = num;
180 num *= 1048576; /* 1 mebibyte *
    [all...]
imaxdiv.c 53 imaxdiv(intmax_t num, intmax_t denom)
59 r.quot = num / denom;
60 r.rem = num % denom;
61 if (num >= 0 && r.rem < 0) {
lldiv.c 53 lldiv(long long int num, long long int denom)
59 r.quot = num / denom;
60 r.rem = num % denom;
61 if (num >= 0 && r.rem < 0) {
qdiv.c 52 qdiv(quad_t num, quad_t denom)
58 r.quot = num / denom;
59 r.rem = num % denom;
60 if (num >= 0 && r.rem < 0) {
Lint_div.c 12 div(int num, int denom)
Lint_ldiv.c 12 ldiv(long num, long denom)
  /src/sys/arch/alpha/common/
shared_intr.c 122 alpha_shared_intr_dispatch(struct alpha_shared_intr *intr, unsigned int num)
127 atomic_add_long(&intr[num].intr_evcnt.ev_count, 1);
129 TAILQ_FOREACH(ih, &intr[num].intr_q, ih_q) {
158 unsigned int num, int type, int level, int flags,
163 if (intr[num].intr_sharetype == IST_UNUSABLE) {
165 basename, num);
178 ih->ih_num = num;
204 unsigned int num = ih->ih_num; local in function:alpha_shared_intr_link_unlink_xcall
206 struct cpu_info *ci = intr[num].intr_cpu;
215 TAILQ_INSERT_TAIL(&intr[num].intr_q, ih, ih_q)
230 unsigned int num = ih->ih_num; local in function:alpha_shared_intr_link
289 unsigned int num = ih->ih_num; local in function:alpha_shared_intr_unlink
    [all...]
  /src/sys/external/gpl2/dts/dist/include/dt-bindings/interrupt-controller/
arm-gic.h 23 #define GIC_CPU_MASK_SIMPLE(num) GIC_CPU_MASK_RAW((1 << (num)) - 1)
  /src/lib/libarch/i386/
i386_get_ldt.c 39 i386_get_ldt(int start, union descriptor *desc, int num)
45 p.num = num;
i386_set_ldt.c 39 i386_set_ldt(int start, union descriptor *desc, int num)
45 p.num = num;
  /src/games/sail/
array.c 58 a->num = a->max = 0;
65 arrayassert(a->num == 0);
73 array_setsize(struct array *a, unsigned num)
77 if (num > a->max) {
79 while (num > newmax) {
86 a->num = num;
95 arrayassert(a->num <= a->max);
96 arrayassert(index_ < a->num);
98 movers = a->num - index_
    [all...]
  /src/games/boggle/boggle/
prtable.c 55 * num - number of entries
66 prtable(const char *const base[], int num, int d_cols, int width,
74 if (num == 0)
76 maxlen = get_maxlen(base, num, length) + 1;
83 nrows = (num - 1) / cols + 1;
86 for (j = 0; j < num; j++) {
91 while (j < num) {
96 for (j++; j < num; j++) {
101 if (j < num) {
116 get_maxlen(const char *const base[], int num,
    [all...]

Completed in 17 milliseconds

1 2 3 4 5 6 7 8 91011>>