Searched +full:- +full:b (Results 1 – 25 of 1840) sorted by relevance
12345678910>>...74
17 …b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*b*…26 /(?(R)a*(?1)|((?R))b)/28 Failed: error -46: JIT stack limit reached93 Failed: error -45: bad JIT option95 Failed: error -45: bad JIT option97 Failed: error -45: bad JIT option115 Failed: error -45: bad JIT option119 Failed: error -45: bad JIT option121 Failed: error -45: bad JIT option185 /(*NO_START_OPT)a(*:m)b/mark[all …]
1 // This file is generated from a similarly-named Perl script in the BoringSSL10 .arch armv8-a+crypto18 stp x29, x30, [sp, #-128]!32 ldr q31, [x19, #-16] // load round N-1 keys37 …ld1 { v0.16b}, [x16] // special case vector load initial counter so we…38 sub x5, x5, #1 // byte_len - 148 aese v0.16b, v18.16b49 aesmc v0.16b, v0.16b // AES block 0 - round 063 aese v0.16b, v19.16b64 aesmc v0.16b, v0.16b // AES block 0 - round 1[all …]
1 // This file is generated from a similarly-named Perl script in the BoringSSL10 .arch armv8-a+crypto20 stp x29, x30, [sp, #-128]!34 ldr q31, [x19, #-16] // load round N-1 keys39 …ld1 { v0.16b}, [x16] // special case vector load initial counter so we…40 sub x5, x5, #1 // byte_len - 150 aese v0.16b, v18.16b51 aesmc v0.16b, v0.16b // AES block 0 - round 065 aese v0.16b, v19.16b66 aesmc v0.16b, v0.16b // AES block 0 - round 1[all …]
1 // This file is generated from a similarly-named Perl script in the BoringSSL18 stp x29, x30, [sp, #-128]!32 ldr q31, [x19, #-16] // load round N-1 keys37 …ld1 { v0.16b}, [x16] // special case vector load initial counter so we…38 sub x5, x5, #1 // byte_len - 148 aese v0.16b, v18.16b49 aesmc v0.16b, v0.16b // AES block 0 - round 063 aese v0.16b, v19.16b64 aesmc v0.16b, v0.16b // AES block 0 - round 167 aese v1.16b, v18.16b[all …]
2 .\" SPDX-License-Identifier: BSD-2-Clause4 .\" Copyright (c) 2018-2024 Gavin D. Howard and contributors.32 bc \- arbitrary\-precision decimal arithmetic language and calculator34 \f[B]bc\f[R] [\f[B]\-cCghilPqRsvVw\f[R]] [\f[B]\-\-digit\-clamp\f[R]]35 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-global\-stacks\f[R]]36 [\f[B]\-\-help\f[R]] [\f[B]\-\-interactive\f[R]] [\f[B]\-\-mathlib\f[R]]37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]]38 [\f[B]\-\-quiet\f[R]] [\f[B]\-\-standard\f[R]] [\f[B]\-\-warn\f[R]]39 [\f[B]\-\-version\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]]40 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...][all …]
3 # These test vectors satisfy A + B = Sum.7 B = 011 B = 013 Sum = -c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccc…14 A = -c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce1…15 B = 019 B = -c590e57ee64fced3ca84d4bb013bba7d633e68b2ff4e27bf1db43f386dbfcce501f112b7fff6fb9436a576ccfccce1…23 B = 23f85668bf4d0fa273d8c7f63c5fee57811062a674111e295a73a58e08dd0fd58eda1f473960559d5b96d1862164e96…27 B = -4b5b16252ba2355e0b87f01baa721783c403607a4c1b5652c09a68e96926c8e314fa580bf0ad3f8f59bd70f14df86a…29 Sum = -c590e57ee64fcec882fef3ffd015a3fd9024d8f5f6d53eb537d6abdb0ff5e76a8fb08d5feed113fc9e74745d957a…[all …]
14 b = 317 c = a + b18 c = b + c20 c = a + b21 c = b + c23 c = c - a24 c = a - b25 c = b - c26 c = c - a27 c = b - c[all …]
4 // Use of this source code is governed by a BSD-style20 if -a != a {27 func i64test(a, b, c int64) { argument29 if d != b {30 println("i64", a, b, c, d)36 var a, b int6441 b = a % 142 i64test(a, b, 1)43 b = a % 244 i64test(a, b, 2)[all …]
4 // Use of this source code is governed by a BSD-style20 if -a != a {27 func i64test(a, b, c int64) { argument29 if d != b {30 println("i64", a, b, c, d)36 var a, b int6441 b = a / 142 i64test(a, b, 1)43 b = a / 244 i64test(a, b, 2)[all …]
35 <b>pcre2grep [options] [long options] [pattern] [path1 path2 ...]</b>39 <b>pcre2grep</b> searches files for character patterns, in the same way as other42 <a href="pcre2syntax.html"><b>pcre2syntax</b>(3)</a>43 for a quick-reference summary of pattern syntax, or44 <a href="pcre2pattern.html"><b>pcre2pattern</b>(3)</a>62 pattern to be matched when neither <b>-e</b> nor <b>-f</b> is present.64 arguments are treated as path names. At least one of <b>-e</b>, <b>-f</b>, or an68 If no files are specified, <b>pcre2grep</b> reads the standard input. The72 pcre2grep some-pattern file1 - file379 options that can change how <b>pcre2grep</b> behaves. For example, the <b>-M</b>[all …]
... l \ Q ( , ! @ U l y C9 - - G - - : : \ 5 c B:
2 .\" SPDX-License-Identifier: BSD-2-Clause4 .\" Copyright (c) 2018-2024 Gavin D. Howard and contributors.32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]]35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]]36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]]37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]]38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]]39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...]40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...][all …]