a\-c (full) in projects: freebsd - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched +full:a +full:- +full:c (Results 1 – 25 of 1458) sorted by relevance

12 3 4 5 6 7 8 9 10 >>...59

/freebsd/lib/libc/regex/grot/
H A D	tests	4 # C flag given, regcomp() is expected to fail, and the third field is the 9 # expected to fail. If there is a fourth field, it is the substring that 10 # the RE is expected to match. If there is a fifth field, it is a comma- 11 # separated list of what the subexpressions should match, with - indicating 12 # no match for that one. In both the fourth and fifth fields, a (sub)field 14 # a null string followed by the stuff after the @; this provides a way to 19 # - placeholder, does nothing 20 # b RE is a BRE, not an ERE 21 # & try it as both an ERE and a BRE 22 # C regcomp() error expected, third field is error name [all …]
/freebsd/contrib/netbsd-tests/lib/libc/regex/data/
H A D	bracket.in	`2 a[b]c & abc abc 3 a[ab]c & abc abc 4 a[^ab]c & adc adc 5 a[]b]c & a]c a]c 6 a[[b]c & a[c a[c 7 a[-b]c & a-c a-c 8 a[^]b]c & adc adc 9 a[^-b]c & adc adc 10 a[b-]c & a-c a-c 11 a[b &C EBRACK [all …]`
H A D	subexp.in	`2 a(b)(c)d - abcd abcd b,c 3 a(((b)))c - abc abc b,b,b 4 a(b\|(c))d - abd abd b,- 5 a(b\|c\|e)d - abbd abbd bb 6 a(b\|c\|e)d - acd acd c 7 a(b*\|c\|e)d - ad ad @d 8 a(b?)c - abc abc b 9 a(b?)c - ac ac @c 10 a(b+)c - abc abc b 11 a(b+)c - abbbc abbbc bbb [all …]`
/freebsd/crypto/openssl/crypto/sha/asm/
H A D	keccak1600-c64x.pl	2 # Copyright 2017-2020 The OpenSSL Project Authors. All Rights Reserved. 5 # this file except in compliance with the License. You can obtain a copy 16 # [ABI- and endian-neutral] Keccak-1600 for C64x. 20 # This is straightforward KECCAK_1X_ALT variant (see sha/keccak1600.c) 21 # with bit interleaving. 64-bit values are simply split between A- and 22 # B-files, with A-file holding least significant halves. This works 23 # out perfectly, because all operations including cross-communications 25 # [incredible for a 32-bit processor] 10.9 cycles per processed byte 26 # for r=1088, which corresponds to SHA3-256. This is >15x faster than 27 # compiler-generated KECCAK_1X_ALT code, and >10x than other variants. [all …]
H A D	keccak1600-armv4.pl	2 # Copyright 2017-2020 The OpenSSL Project Authors. All Rights Reserved. 5 # this file except in compliance with the License. You can obtain a copy 16 # Keccak-1600 for ARMv4. 20 # Non-NEON code is KECCAK_1X variant (see sha/keccak1600.c) with bit 22 # fast, but several times smaller, and is endian- and ISA-neutral. ISA 24 # be assembled even as Thumb-2. NEON code path is KECCAK_1X_ALT with 26 # in fact faster by 10-15% on some processors, and endian-neutral. 30 # Switch to KECCAK_2X variant for non-NEON code and merge almost 1/2 33 # minimizes re-loads from temporary storage, and merged rotates just 39 # e.g. 'eor a,b>>>x,c>>>y'. This conundrum is resolved by using [all …]
H A D	keccak1600-armv8.pl	2 # Copyright 2017-2020 The OpenSSL Project Authors. All Rights Reserved. 5 # this file except in compliance with the License. You can obtain a copy 16 # Keccak-1600 for ARMv8. 22 # 64-bit lanes of vector registers can't be addressed as easily as in 23 # 32-bit mode. This means that 64-bit NEON is bound to be slower than 24 # 32-bit NEON, and this implementation is faster than 32-bit NEON on 31 # Add hardware-assisted ARMv8.2 implementation. It's KECCAK_1X_ALT 36 # support [yet?]. But lowest-level core procedure is prepared for it. 47 # Cortex-A53 13 48 # Cortex-A57 12 [all …]
/freebsd/lib/libmd/
H A D	rmd160c.c	1 /* crypto/ripemd/rmd_dgst.c / 2 / Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 9 * This library is free for commercial and non-commercial use as long as 18 * If this package is used in a product, Eric Young should be given attribution 20 * This can be in the form of a textual message at program startup or 36 * being used are not cryptographic related :-). 37 * 4. If you include any Windows specific code (or a derivative thereof) from 43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 65 #include <machine/ansi.h> /* we use the __ variants of bit-sized types / 72 The assembly-language code is not position-independent, so don't [all …]
H A D	sha1c.c	1 /* crypto/sha/sha1dgst.c / 2 / Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 9 * This library is free for commercial and non-commercial use as long as 18 * If this package is used in a product, Eric Young should be given attribution 20 * This can be in the form of a textual message at program startup or 36 * being used are not cryptographic related :-). 37 * 4. If you include any Windows specific code (or a derivative thereof) from 43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 65 #include <machine/ansi.h> /* we use the __ variants of bit-sized types / 75 The assembly-language code is not position-independent, so don't [all …]
H A D	sha0c.c	1 /* crypto/sha/sha_dgst.c / 2 / Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 9 * This library is free for commercial and non-commercial use as long as 18 * If this package is used in a product, Eric Young should be given attribution 20 * This can be in the form of a textual message at program startup or 36 * being used are not cryptographic related :-). 37 * 4. If you include any Windows specific code (or a derivative thereof) from 43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 65 #include <machine/ansi.h> /* we use the __ variants of bit-sized types / 74 char SHA_version="SHA part of SSLeay 0.9.0b 11-Oct-1998"; [all …]
/freebsd/crypto/openssl/crypto/ripemd/
H A D	rmd_dgst.c	2 * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved. 5 * this file except in compliance with the License. You can obtain a copy 21 void ripemd160_block_x86(RIPEMD160_CTX c, unsigned long p, size_t num); 24 void ripemd160_block(RIPEMD160_CTX c, unsigned long p, size_t num); 27 int RIPEMD160_Init(RIPEMD160_CTX c) in RIPEMD160_Init() argument 29 memset(c, 0, sizeof(c)); in RIPEMD160_Init() 30 c->A = RIPEMD160_A; in RIPEMD160_Init() 31 c->B = RIPEMD160_B; in RIPEMD160_Init() 32 c->C = RIPEMD160_C; in RIPEMD160_Init() 33 c->D = RIPEMD160_D; in RIPEMD160_Init() [all …]
/freebsd/lib/libpathconv/tests/
H A D	test.pl	`3 # Copyright (c) 1997 Shigio Yamaguchi. All rights reserved. 4 # Copyright (c) 1999 Tama Communications Corporation. All rights reserved. 17 # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 35 # -------------------------------------- 38 'a/b/c / a/b/c', 39 'a/b/c /a a/b/c', 40 '/a/b/c a ERROR', 45 '/a/b/c / /a/b/c', 46 '/a/b/c /a /a/b/c', 47 'a/b/c a ERROR', [all …]`
/freebsd/sys/powerpc/include/
H A D	pio.h	1 /- 2 SPDX-License-Identifier: BSD-4-Clause 4 * Copyright (c) 1997 Per Fogelstrom, Opsycon AB and RTMX Inc, USA. 23 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 45 * mutex-protected sections (mutex release does not guarantee completion of 46 * accesses to caching-inhibited memory on some systems) 51 __outb(volatile u_int8_t a, u_int8_t v) in __outb() argument 53 a = v; in __outb() 58 __outw(volatile u_int16_t a, u_int16_t v) in __outw() argument 60 a = v; in __outw() [all …]
/freebsd/contrib/lua/src/
H A D	lopcodes.h	`14 We assume that instructions are unsigned 32-bit integers. 20 iABC C(8) \| B(8) \|k\| A(8) \| Op(7) \| 21 iABx Bx(17) \| A(8) \| Op(7) \| 22 iAsBx sBx (signed)(17) \| A(8) \| Op(7) \| 26 A signed argument is represented in excess K: the represented value is 68 #define L_INTHASBITS(b) ((UINT_MAX >> ((b) - 1)) >= 1) 72 #define MAXARG_Bx ((1<<SIZE_Bx)-1) 81 #define MAXARG_Ax ((1<<SIZE_Ax)-1) 87 #define MAXARG_sJ ((1 << SIZE_sJ) - 1) 95 #define MAXARG_A ((1<<SIZE_A)-1) [all …]`
/freebsd/contrib/llvm-project/compiler-rt/lib/tsan/rtl/
H A D	tsan_md5.cpp	1 //===-- tsan_md5.cpp ------------------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 9 // This file is a part of ThreadSanitizer (TSan), a race detector. 11 //===----------------------------------------------------------------------===// 21 #define STEP(f, a, b, c, d, x, t, s) \ argument 22 (a) += f((b), (c), (d)) + (x) + (t); \ 23 (a) = (((a) << (s)) \| (((a) & 0xffffffff) >> (32 - (s)))); \ 24 (a) += (b); 36 MD5_u32plus a, b, c, d; member [all …]
/freebsd/contrib/ntp/libntp/lib/isc/
H A D	sha1.c	2 * Copyright (C) 2004, 2005, 2007, 2009, 2011, 2012 Internet Systems Consortium, Inc. ("ISC") 3 * Copyright (C) 2000, 2001, 2003 Internet Software Consortium. 20 /* $NetBSD: sha1.c,v 1.5 2000/01/22 22:19:14 mycroft Exp $ / 21 / $OpenBSD: sha1.c,v 1.9 1997/07/23 21:12:32 kstailey Exp $ / 24 SHA-1 in C 28 * Test Vectors (from FIPS PUB 180-1) 30 * A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D 33 * A million repetitions of "a" 82 #define rol(value, bits) (((value) << (bits)) \| ((value) >> (32 - (bits)))) 91 (block->l[i] = (rol(block->l[i], 24) & 0xFF00FF00) \ [all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A D	SHA1.cpp	1 //====- SHA1.cpp - Private copy of the SHA1 implementation ---- C++ - ======// 5 // SPDX-License-Identifie 39 r0(uint32_t & A,uint32_t & B,uint32_t & C,uint32_t & D,uint32_t & E,int I,uint32_t * Buf) r0() argument 45 r1(uint32_t & A,uint32_t & B,uint32_t & C,uint32_t & D,uint32_t & E,int I,uint32_t * Buf) r1() argument 51 r2(uint32_t & A,uint32_t & B,uint32_t & C,uint32_t & D,uint32_t & E,int I,uint32_t * Buf) r2() argument 57 r3(uint32_t & A,uint32_t & B,uint32_t & C,uint32_t & D,uint32_t & E,int I,uint32_t * Buf) r3() argument 63 r4(uint32_t & A,uint32_t & B,uint32_t & C,uint32_t & D,uint32_t & E,int I,uint32_t * Buf) r4() argument 92 uint32_t A = InternalState.State[0]; hashBlock() local 94 uint32_t C = InternalState.State[2]; hashBlock() local 232 for (uint8_t C : Data) update() local [all...]
/freebsd/crypto/openssl/test/
H A D	build.info	1 # TODO: use ../apps/libapps.a instead of direct ../apps/lib source. 4 # Most of all, ../apps/lib/apps.c needs to be divided in smaller pieces to 8 IF[{- $config{target} =~ /^(?:VC-\|mingw\|BC-)/ -}] 10 $AUXLIBAPPSSRC=../apps/lib/win32_init.c 12 IF[{- $config{target} =~ /^vms-/ -}] 13 $AUXLIBAPPSSRC=../apps/lib/vms_term_sock.c ../apps/lib/vms_decc_argv.c 16 # source, and can therefore not be part of a library. 17 IF[{- !$disabled{uplink} -}] 18 $INITSRC=../ms/applink.c 20 $LIBAPPSSRC=../apps/lib/opt.c $AUXLIBAPPSSRC [all …]
/freebsd/contrib/wpa/src/crypto/
H A D	sha1-internal.c	`3 * Copyright (c) 2003-2005, Jouni Malinen <j@w1.fi> 24 * sha1_vector - SHA-1 hash for data vector 29 * Returns: 0 on success, -1 of failure 37 return -1; in sha1_vector() 48 /* ===== start - public domain SHA1 implementation ===== */ 51 SHA-1 in C 52 By Steve Reid <sreid@sea-to-sky.net> 55 ----------------- 60 Corrected a problem which generated improper hash values on 16 bit machines 72 greater than 8191 (8K - 1) due to the 'len << 3' on line 3 of SHA1Update(). [all …]`
/freebsd/sys/libkern/
H A D	jenkins_hash.c	2 * Taken from http://burtleburtle.net/bob/c/lookup3.c 9 ------------------------------------------------------------------------------- 10 lookup3.c, by Bob Jenkins, May 2006, Public Domain. 12 These are functions for producing 32-bit hashes for hash table lookup. 20 little-endian machines. Intel and AMD are little-endian machines. 22 hashlittle() except it returns two 32-bit hashes for the price of one. 25 If you want to find a hash of, say, exactly 7 integers, do 26 a = i1; b = i2; c = i3; 27 mix(a,b,c); 28 a += i4; b += i5; c += i6; [all …]
/freebsd/contrib/ldns/
H A D	sha1.c	`4 * SHA-1 in C 8 * Test Vectors (from FIPS PUB 180-1) 10 * A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D 13 * A million repetitions of "a" 24 #define rol(value, bits) (((value) << (bits)) \| ((value) >> (32 - (bits)))) 29 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ 30 \|(rol(block->l[i],8)&0x00FF00FF)) 32 #define blk0(i) block->l[i] 34 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ 35 ^block->l[(i+2)&15]^block->l[i&15],1)) [all …]`
/freebsd/contrib/ncurses/doc/
H A D	hackguide.doc	`1 A Hacker's Guide to NCURSES 3 A Hacker's Guide to NCURSES 14 * A Tour of the Ncurses Library 21 * A Tour of the Terminfo Compiler 22 + Translation of Non-use Capabilities 24 + Source-Form Translation 31 This document is a hacker's tour of the ncurses library and utilities. 39 The objective of the ncurses package is to provide a free software API 40 for character-cell terminals and terminal emulators with the following 42 * Source-compatible with historical curses implementations [all …]`
/freebsd/crypto/openssh/openbsd-compat/
H A D	sha1.c	1 /* $OpenBSD: sha1.c,v 1.27 2019/06/07 22:56:36 dtucker Exp $ / 4 SHA-1 in C 8 * Test Vectors (from FIPS PUB 180-1) 10 * A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D 13 * A million repetitions of "a" 24 #define rol(value, bits) (((value) << (bits)) \| ((value) >> (32 - (bits)))) 31 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ 32 \|(rol(block->l[i],8)&0x00FF00FF)) 34 # define blk0(i) block->l[i] 36 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ [all …]
/freebsd/crypto/openssl/test/recipes/04-test_pem_reading_data/
H A D	cert-onecolumn.pem	`1 -----BEGIN CERTIFICATE----- 8 C 9 C 10 A 13 C 14 C 16 C 28 A 42 A 46 A [all …]`
/freebsd/contrib/llvm-project/lldb/bindings/interface/
H A D	SBTypeDocstrings.i	`2 "Represents a member of a type." 6 "Represents a member function of a type." 10 "Represents a data type in lldb. 14 to compile the target program. See the language-specific notes in the 17 SBType instances can be obtained by a variety of methods. 20 information. For some languages such as C, C++ and Objective- [all...]`
/freebsd/contrib/libucl/doc/
H A D	libucl.3	9 \f[B]ucl_parser_set_filevars\f[] \- universal configuration library 13 UCL library (libucl, \-lucl) 16 \f[C]#include\ <ucl.h>\f[] 19 Libucl is a parser and \f[C]C\f[] API to parse and generate \f[C]ucl\f[] 24 Used to parse \f[C]ucl\f[] files and provide interface to extract 25 \f[C]ucl\f[] object. 26 Currently, \f[C]libucl\f[] can parse only full \f[C]ucl\f[] documents, 27 for instance, it is impossible to parse a part of document and therefore 28 it is impossible to use \f[C]libucl\f[] as a streaming parser. 32 Convert \f[C]ucl\f[] objects to some textual or binary representation. [all …]

12 3 4 5 6 7 8 9 10 >>...59