/freebsd-11-stable/lib/libc/stdio/ |
H A D | xprintf_int.c | 392 else if (pi->pad == '0' && pi->width > l && !pi->left) 411 if (pi->width > (pe - p) && !pi->left) { 421 if (!pi->left && pi->width > l) 432 if (pi->width > ret && pi->left)
|
H A D | xprintf_float.c | 332 * After any left-hand padding and prefixing, emit zeroes 347 if (pi->pad != '0' && pi->left == 0) 360 if (pi->pad == '0' && pi->left == 0) 413 /* left-adjusting padding (always blank) */ 414 if (pi->left)
|
/freebsd-11-stable/sys/contrib/ck/include/ |
H A D | ck_barrier.h | 55 struct ck_barrier_combining_group *left; member in struct:ck_barrier_combining_group
|
/freebsd-11-stable/contrib/wpa/src/utils/ |
H A D | os_internal.c | 436 size_t left = siz; local 438 if (left) { 440 while (--left != 0) { 446 if (left == 0) {
|
/freebsd-11-stable/contrib/ipfilter/ |
H A D | radix_ipf.h | 24 struct ipf_rdx_node *left; member in struct:ipf_rdx_node
|
/freebsd-11-stable/sys/contrib/ipfilter/netinet/ |
H A D | radix_ipf.h | 22 struct ipf_rdx_node *left; member in struct:ipf_rdx_node
|
/freebsd-11-stable/contrib/gcc/ |
H A D | tree-chrec.c | 102 tree left, right; 148 left = chrec_fold_plus 155 left = chrec_fold_minus 162 return left; 165 (CHREC_VARIABLE (poly0), left, right); 753 tree left = reset_evolution_in_loop (loop_num, CHREC_LEFT (chrec), 757 return build3 (POLYNOMIAL_CHREC, TREE_TYPE (left), 759 left, right); 1148 cast unsigned char [254, +, 1] to unsigned, the values on left side 1328 tree inner_type, left, righ 101 tree left, right; local 750 tree left = reset_evolution_in_loop (loop_num, CHREC_LEFT (chrec), local 1323 tree inner_type, left, right, lc, rc; local [all...] |
/freebsd-11-stable/contrib/byacc/test/ |
H A D | btyacc_demo.y | 47 %left '+' '-' 48 %left '*' '/' '%' 222 extern Expr * build_expr(Expr *left, enum Operator op, Expr *right);
|
/freebsd-11-stable/contrib/diff/src/ |
H A D | sdiff.c | 149 {"left-column", 0, 0, 'l'}, 195 N_("-l --left-column Output only the left column of common lines."), 510 diffarg ("--left-column"); 587 FILE *left, *right, *out, *diffout; 599 left = ck_fopen (lname, "r"); 699 lf_init (&lfilt, left); 704 ck_fclose (left); 864 el or e1:\tEdit then use the left version.\n\ 867 l or 1:\tUse the left versio 585 FILE *left, *right, *out, *diffout; local 900 edit(struct line_filter *left, char const *lname, lin lline, lin llen, struct line_filter *right, char const *rname, lin rline, lin rlen, FILE *outfile) argument 1123 interact(struct line_filter *diff, struct line_filter *left, char const *lname, struct line_filter *right, char const *rname, FILE *outfile) argument [all...] |
/freebsd-11-stable/contrib/groff/src/preproc/eqn/ |
H A D | eqn.y | 101 /* The original eqn manual says that `left' is right associative. It's lying. 102 Consider `left ( ~ left ( ~ right ) right )'. */ 105 %left RIGHT 108 %left SQRT OVER SMALLOVER 112 %left ACCENT UACCENT
|
/freebsd-11-stable/contrib/sendmail/contrib/ |
H A D | buildvirtuser | 46 usernames on the left and the actual address for that username on the 47 right. An empty left column translates to the default for that domain. 51 the left hand side.
|
/freebsd-11-stable/sys/dev/videomode/ |
H A D | pickmode.c | 104 swap_modes(struct videomode *left, struct videomode *right) argument 108 temp = *left; 109 *left = *right;
|
/freebsd-11-stable/usr.bin/xlint/lint1/ |
H A D | cgram.y | 183 %left T_COMMA 186 %left T_LOGOR 187 %left T_LOGAND 188 %left T_OR 189 %left T_XOR 190 %left T_AND 191 %left T_EQOP 192 %left T_RELOP 193 %left T_SHFTOP 194 %left T_ADDO [all...] |
/freebsd-11-stable/contrib/mdocml/ |
H A D | eqn_html.c | 199 if (NULL != bp->left || NULL != bp->right) 201 "open", bp->left == NULL ? "" : bp->left,
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Interpreter/ |
H A D | OptionValueDictionary.cpp | 219 llvm::StringRef left, temp; 220 std::tie(left, temp) = name.split('['); 221 if (left.size() == name.size()) {
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_x/ |
H A D | string_table.c | 57 struct builder_string_t *left; 143 apr_size_t left_height = node->left ? node->left->depth + 1 : 0; 148 builder_string_t *temp = node->left->right; 149 node->left->right = node; 150 *parent = node->left; 151 node->left = temp; 157 builder_string_t *temp = node->right->left; 159 node->right->left = node; 192 if (current->left 55 struct builder_string_t *left; member in struct:builder_string_t [all...] |
/freebsd-11-stable/contrib/wpa/src/eap_peer/ |
H A D | eap_fast.c | 868 size_t left, len; local 872 left = pac_len; 874 while (left > sizeof(*hdr)) { 879 left -= sizeof(*hdr); 880 if (len > left) { 882 "(type=%d len=%lu left=%lu)", 884 (unsigned long) left); 891 left -= len; 988 size_t left, len; local 997 left 1478 eap_fast_process_start(struct eap_sm *sm, struct eap_fast_data *data, u8 flags, const u8 *pos, size_t left) argument 1532 size_t left; local [all...] |
H A D | eap_tls_common.c | 633 wpa_printf(MSG_DEBUG, "SSL: %lu bytes left to be sent out (of total " 908 size_t left; local 920 &left); 924 &left); 927 &left); 932 if (left == 0) { 945 left--; 951 if (left < 4) { 967 left -= 4; 969 if (left > tls_msg_le [all...] |
/freebsd-11-stable/contrib/libgnuregex/ |
H A D | regcomp.c | 113 bin_tree_t *left, bin_tree_t *right, 116 bin_tree_t *left, bin_tree_t *right, 1223 /* Descend down the tree, preferably to the left (or to the right 1225 while (node->left || node->right) 1226 if (node->left) 1227 node = node->left; 1259 /* Go to the left node, or up and to the right. */ 1260 if (node->left) 1261 node = node->left; 1293 && node->left 1427 int left, right; local 3728 create_tree(re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, re_token_type_t type) argument 3737 create_token_tree(re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, const re_token_t *token) argument [all...] |
/freebsd-11-stable/sys/dev/sdhci/ |
H A D | sdhci.c | 472 size_t left; local 477 left = min(512, slot->curcmd->data->len - slot->offset); 478 slot->offset += left; 485 while (left > 3) { 492 left -= 4; 496 (uint32_t *)buffer, left >> 2); 497 left &= 3; 500 if (left > 0) { 502 while (left > 0) { 505 left 515 size_t left; local 1765 size_t left; local 1932 size_t left; local [all...] |
/freebsd-11-stable/contrib/dialog/ |
H A D | buttons.c | 37 int left = 0, right = 0; local 41 left = (longest - len) / 2; 42 right = (longest - len - left); 43 if (left > 0) 44 sprintf(buffer, "%*s", left, " ");
|
/freebsd-11-stable/sys/contrib/zlib/ |
H A D | inflate.c | 479 left = strm->avail_out; \ 490 strm->avail_out = left; \ 568 input left to load n bits into the accumulator, or it continues. BITS(n) 581 state information is maintained to continue the loop where it left off 629 unsigned have, left; /* available input and output */ local 653 out = left; 907 if (copy > left) copy = left; 912 left -= copy; 1045 if (have >= 6 && left > [all...] |
/freebsd-11-stable/contrib/llvm-project/lld/lib/ReaderWriter/MachO/ |
H A D | LayoutPass.cpp | 179 const DefinedAtom *left = lc._atom.get(); local 181 if (left == right) { 244 llvm::errs() << "Unordered: <" << left->name() << "> <" << right->name() 482 ctx.registry(), [&](const DefinedAtom * left, const DefinedAtom * right, 484 return ctx.customAtomOrderer(left, right, leftBeforeRight);
|
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | jv-exp.y | 185 %left ',' 188 %left OROR 189 %left ANDAND 190 %left '|' 191 %left '^' 192 %left '&' 193 %left EQUAL NOTEQUAL 194 %left '<' '>' LEQ GEQ 195 %left LSH RSH 196 %left ' [all...] |
/freebsd-11-stable/contrib/binutils/ld/ |
H A D | ldgram.y | 113 %left <token> OROR 114 %left <token> ANDAND 115 %left <token> '|' 116 %left <token> '^' 117 %left <token> '&' 118 %left <token> EQ NE 119 %left <token> '<' '>' LE GE 120 %left <token> LSHIFT RSHIFT 122 %left <token> '+' '-' 123 %left <toke [all...] |