Searched refs:ll (Results 101 - 125 of 159) sorted by relevance

1234567

/freebsd-9.3-release/contrib/groff/src/devices/grops/
H A Dpsrm.cpp1039 unsigned ll; local
1040 if (read_uint_arg(&ptr, &ll) && ll > language_level)
1041 language_level = ll;
/freebsd-9.3-release/contrib/libpcap/
H A Dpcap-usb-linux.c84 #define htol64(ll) ll
88 #define htol64(ll) bswap_64(ll)
/freebsd-9.3-release/contrib/llvm/lib/Support/Windows/
H A DSignals.inc36 // the ll format specifier for printf. However, MinGW passes the format
37 // specifiers on to the MSVCRT entirely, and the CRT understands the ll
475 // complain about the ll format specifiers used. Now we are turning the
/freebsd-9.3-release/rescue/rescue/
H A DMakefile41 # Note that if 'librescue' hasn't been compiled, we'll just get the
55 CRUNCH_LIBS+= -lcrypt -ledit -ljail -lkvm -ll -ltermcap -lutil
/freebsd-9.3-release/usr.sbin/tcpdump/tcpdump/
H A DMakefile165 LDADD= -ll -lpcap
/freebsd-9.3-release/sys/crypto/camellia/
H A Dcamellia.c84 #define CAMELLIA_ROLDQ(ll, lr, rl, rr, w0, w1, bits) \
86 w0 = ll; \
87 ll = (ll << bits) + (lr >> (32 - bits)); \
93 #define CAMELLIA_ROLDQo32(ll, lr, rl, rr, w0, w1, bits) \
95 w0 = ll; \
97 ll = (lr << (bits - 32)) + (rl >> (64 - bits)); \
128 #define CAMELLIA_FLS(ll, lr, rl, rr, kll, klr, krl, krr, t0, t1, t2, t3) \
132 t0 &= ll; \
140 ll
[all...]
/freebsd-9.3-release/crypto/openssl/crypto/camellia/
H A Dcamellia.c108 #define CAMELLIA_ROLDQ(ll, lr, rl, rr, w0, w1, bits) \
111 w0 = ll; \
112 ll = (ll << bits) + (lr >> (32 - bits)); \
118 #define CAMELLIA_ROLDQo32(ll, lr, rl, rr, w0, w1, bits) \
121 w0 = ll; \
123 ll = (lr << (bits - 32)) + (rl >> (64 - bits)); \
158 #define CAMELLIA_FLS(ll, lr, rl, rr, kll, klr, krl, krr, t0, t1, t2, t3) \
162 t0 &= ll; \
166 ll
[all...]
/freebsd-9.3-release/contrib/bmake/mk/sys/
H A DUnixWare.mk228 ${LINK.c} -o ${.TARGET} lex.yy.c ${LDLIBS} -ll
/freebsd-9.3-release/contrib/bmake/mk/
H A Dwarnings.mk77 # its redundant - we'll sort -u
H A Ddpadd.mk123 # If INCLUDES_libfoo is not set, then we'll use ${SRC_libfoo}/h if it exists,
/freebsd-9.3-release/contrib/sendmail/libsm/
H A Dvfprintf.c588 ULONGLONG_T ll; member in union:__anon4037
594 _uquad = u.ll;
/freebsd-9.3-release/share/mk/
H A Dbsd.sys.mk126 # Eventually we'll want to start building the base system C++ code as C++11,
H A Dsys.mk310 ${CC} ${CFLAGS} ${LDFLAGS} ${.PREFIX}.tmp.c ${LDLIBS} -ll -o ${.TARGET}
/freebsd-9.3-release/contrib/bind9/bin/named/
H A Dinterfacemgr.c732 ns_listenlist_t *ll; local
769 ll = (family == AF_INET) ? mgr->listenon4 : mgr->listenon6;
771 for (le = ISC_LIST_HEAD(ll->elts);
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Headers/
H A DIntrin.h540 *a = *a ^ (1ll << b);
546 *a = *a & ~(1ll << b);
552 *a = *a | (1ll << b);
/freebsd-9.3-release/contrib/ntp/sntp/
H A Dmain.c393 ** Unless we specify a socktype, we'll get at least two
1171 long long ll; local
1226 if (1 == sscanf(p_SNTP_PRETEND_TIME, "%lld", &ll))
1227 pretend_time = (time_t)ll;
/freebsd-9.3-release/crypto/openssh/
H A Dsftp.c2222 LogLevel ll = SYSLOG_LEVEL_INFO; local
2244 ll = SYSLOG_LEVEL_INFO;
2265 ll = SYSLOG_LEVEL_ERROR;
2276 ll = SYSLOG_LEVEL_DEBUG1 + debug_level;
2349 log_init(argv[0], ll, SYSLOG_FACILITY_USER, 1);
/freebsd-9.3-release/contrib/lukemftpd/src/
H A Dftpcmd.y133 LLT ll;
891 restart_point = (off_t)$4.ll;
1636 yylval.u.ll = STRTOLL(cp, (char **)NULL, 10);
/freebsd-9.3-release/contrib/sendmail/src/
H A Dmain.c3949 int ll; local
3953 ll = 7;
3956 if (ll + strlen(*av) > 63)
3959 ll = 0;
3961 if (ll == 0)
3966 ll += strlen(*av++) + 1;
/freebsd-9.3-release/contrib/gcc/config/
H A Dfp-bit.h370 fractype ll; member in union:__anon1071::__anon1072
/freebsd-9.3-release/contrib/gcc/
H A Dlibgcc2.h417 `ll' field, and the unpacked result is read from the struct `s'. */
422 DWtype ll; member in union:__anon1188
/freebsd-9.3-release/sys/cddl/boot/zfs/
H A Dzfssubr.c803 * First initialize the storage where we'll compute the inverse rows.
887 int ll; local
937 if ((ll = log + invlog[cc][i]) >= 255)
938 ll -= 255;
939 val = vdev_raidz_pow2[ll];
1627 * before, all children will be marked as tried so we'll
/freebsd-9.3-release/usr.sbin/crunch/examples/
H A Dreally-big.conf150 # I'll go ahead and solve it as an example.
158 libs -ll -ly -lm -lresolv -lrpcsvc -lcompat
/freebsd-9.3-release/usr.bin/truss/
H A Dsyscalls.c661 /* Find out how large of a buffer we'll need. */
688 unsigned long long ll; local
689 ll = *(unsigned long long *)(args + sc->offset);
690 asprintf(&tmp, "0x%llx", ll);
/freebsd-9.3-release/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dvdev_raidz.c1148 * First initialize the storage where we'll compute the inverse rows.
1233 int ll; local
1282 if ((ll = log + invlog[cc][i]) >= 255)
1283 ll -= 255;
1284 val = vdev_raidz_pow2[ll];
2275 * as tried so we'll proceed to combinatorial reconstruction.

Completed in 187 milliseconds

1234567