HomeSort by: relevance | last modified time | path
    Searched defs:ZERO (Results 1 - 8 of 8) sorted by relevancy

  /src/tests/lib/libc/net/
t_ether_aton.c 62 #define ZERO { 0, 0, 0, 0, 0, 0 }
63 { ZERO, "0:1:2-3:04:05:06", ENAMETOOLONG },
64 { ZERO, "0:1:2-3:04:", ENOBUFS },
65 { ZERO, "0:1:2-3:04:x7", EINVAL },
66 { ZERO, "1:x-3:04:05:7", EINVAL },
67 { ZERO, NULL, 0 },
  /src/usr.bin/make/unit-tests/
cond-func-empty.mk 13 ZERO= 0
82 # The variable ZERO has the numeric value 0, but is not empty. This is a
83 # subtle difference between using either 'empty(ZERO)' or the expression
84 # '${ZERO}' in a condition.
85 .if empty(ZERO)
87 .elif ${ZERO}
89 .elif ${ZERO} == ""
varmod-select-words.mk 23 ZERO= 0
170 @echo 'LIST:[$${ZERO}]="${LIST:[${ZERO}]}"'
171 @echo 'LIST:[$${ZERO}x$${ONE}]="${LIST:[${ZERO}x${ONE}]}"'
  /src/usr.bin/seq/
seq.c 47 #define ZERO '0'
114 char pad = ZERO;
180 /* Plan 9/GNU don't do zero */
182 errx(1, "zero %screment", (first < last)? "in" : "de");
449 /* zero shall have no sign */
  /src/lib/libcrypt/
crypt.c 136 * most significant ones. The low two bits of each byte are zero. (Thus,
164 * high-order zero, providing fast indexing into a 64-bit wide SPE.) On the
256 #define ZERO(d,d0,d1) d0 = 0, d1 = 0
310 ZERO(D,D0,D1);
  /src/sys/external/bsd/sljit/dist/sljit_src/
sljitNativeTILEGX_64.c 73 #define ZERO 63
940 inst[0] = BEQZ_X1 | SRCA_X1(ZERO);
1126 return ADDLI(dst_ar, ZERO, imm);
1129 FAIL_IF(ADDLI(dst_ar, ZERO, imm >> 16));
1134 FAIL_IF(ADDLI(dst_ar, ZERO, imm >> 32));
1139 FAIL_IF(ADDLI(dst_ar, ZERO, imm >> 48));
1150 FAIL_IF(ADDLI_SOLO(dst_ar, ZERO, imm >> 32));
1155 FAIL_IF(ADDLI(dst_ar, ZERO, imm >> 32));
1165 FAIL_IF(ADDLI_SOLO(reg_map[dst_ar], ZERO, imm >> 48));
1171 FAIL_IF(ADDLI(reg_map[dst_ar], ZERO, imm >> 48))
    [all...]
  /src/sys/dev/microcode/aic7xxx/
aic7xxx_reg.h 1457 #define ZERO 0x02
aic79xx_reg.h 3456 #define ZERO 0x02

Completed in 21 milliseconds