/freebsd-10.0-release/contrib/dialog/samples/ |
H A D | infobox | 6 left=10 8 while test $left != 0 18 You have $left $unit to read this..." 10 52 19 left=`expr $left - 1` 20 test $left = 1 && unit="second"
|
H A D | infobox1 | 6 left=10 8 while test $left != 0 18 You have $left $unit to read this..." 10 52 19 left=`expr $left - 1` 20 test $left = 1 && unit="second"
|
H A D | infobox2 | 6 left=10 8 while test $left != 0 18 You have $left $unit to read this..." 0 0 19 left=`expr $left - 1` 20 test $left = 1 && unit="second"
|
H A D | infobox3 | 6 left=10 8 while test $left != 0 19 You have $left $unit to read this..." 0 0 20 left=`expr $left - 1` 21 test $left = 1 && unit="second"
|
H A D | infobox4 | 6 left=10 8 while test $left != 0 19 You have $left $unit to read this..." 0 0 20 left=`expr $left - 1` 21 test $left = 1 && unit="second"
|
H A D | rotated-data | 8 left=$1 9 next=`expr $left + 1` 13 left=1 17 char=`echo "$@" | cut -b -${left}`
|
H A D | infobox6 | 12 left=10 20 while test $left != 0 25 --begin $left `expr $left + 5` \ 32 You have $left $unit to read this..." 0 0 $last 35 left=`expr $left - 1` 36 test $left = 1 && unit="second"
|
H A D | infobox5 | 10 left=10 18 while test $left != 0 30 You have $left $unit to read this..." 0 0 $last 33 left=`expr $left - 1` 34 test $left = 1 && unit="second"
|
/freebsd-10.0-release/contrib/compiler-rt/lib/sparc64/ |
H A D | udivsi3.S | 1 ! This file intentionally left blank
|
H A D | umodsi3.S | 1 ! This file intentionally left blank
|
/freebsd-10.0-release/crypto/openssh/openbsd-compat/ |
H A D | realpath.c | 49 * in which case the path which caused trouble is left in (resolved). 59 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; local 69 left_len = strlcpy(left, path + 1, sizeof(left)); 76 left_len = strlcpy(left, path, sizeof(left)); 78 if (left_len >= sizeof(left) || resolved_len >= PATH_MAX) { 84 * Iterate over path components in `left'. 88 * Extract the next path component and adjust `left' 91 p = strchr(left, '/'); [all...] |
/freebsd-10.0-release/usr.bin/m4/ |
H A D | parser.y | 36 %left LOR 37 %left LAND 38 %left '|' 39 %left '^' 40 %left '&' 41 %left EQ NE 42 %left '<' LE '>' GE 43 %left LSHIFT RSHIFT 44 %left '+' '-' 45 %left '*' '/' ' [all...] |
/freebsd-10.0-release/contrib/wpa/src/crypto/ |
H A D | aes-ctr.c | 28 size_t j, len, left = data_len; local 38 while (left > 0) { 41 len = (left < AES_BLOCK_SIZE) ? left : AES_BLOCK_SIZE; 45 left -= len;
|
H A D | aes-omac1.c | 48 size_t i, e, left, total_len; local 58 left = total_len; 64 while (left >= AES_BLOCK_SIZE) { 73 if (left > AES_BLOCK_SIZE) 75 left -= AES_BLOCK_SIZE; 82 if (left || total_len == 0) { 83 for (i = 0; i < left; i++) { 91 cbc[left] ^= 0x80;
|
/freebsd-10.0-release/lib/libugidfw/ |
H A D | ugidfw.c | 66 size_t left, len; local 70 left = buflen; 73 len = snprintf(cur, left, "subject "); 74 if (len < 0 || len > left) 76 left -= len; 80 len = snprintf(cur, left, "not "); 81 if (len < 0 || len > left) 83 left -= len; 91 len = snprintf(cur, left, "! "); 92 if (len < 0 || len > left) [all...] |
/freebsd-10.0-release/lib/libc/stdlib/ |
H A D | realpath.c | 48 * in which case the path which caused trouble is left in (resolved). 58 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; local 82 left_len = strlcpy(left, path + 1, sizeof(left)); 94 left_len = strlcpy(left, path, sizeof(left)); 96 if (left_len >= sizeof(left) || resolved_len >= PATH_MAX) { 104 * Iterate over path components in `left'. 108 * Extract the next path component and adjust `left' 111 p = strchr(left, '/'); [all...] |
/freebsd-10.0-release/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
H A D | erase_fn_imps.hpp | 129 const size_type left = partition(pred_t(pred)); local 131 _GLIBCXX_DEBUG_ASSERT(m_size >= left); 133 const size_type ersd = m_size - left; 135 for (size_type i = left; i < m_size; ++i) 141 resize_policy::get_new_size_for_arbitrary(left); 145 std::copy(m_a_entries, m_a_entries + left, a_entries); 156 m_size = left; 228 size_type left = 0; local 231 while (right + 1 != left) 233 _GLIBCXX_DEBUG_ASSERT(left < [all...] |
/freebsd-10.0-release/contrib/unbound/util/ |
H A D | rbtree.c | 61 /** rotate subtree left (to preserve redblack property) */ 103 * Rotates the node to the left. 110 node->right = right->left; 111 if (right->left != RBTREE_NULL) 112 right->left->parent = node; 117 if (node == node->parent->left) { 118 node->parent->left = right; 125 right->left = node; 136 rbnode_t *left = node->left; local [all...] |
/freebsd-10.0-release/contrib/apr/include/ |
H A D | apr_user.h | 104 * @param left One uid to test 111 APR_DECLARE(apr_status_t) apr_uid_compare(apr_uid_t left, apr_uid_t right); 113 #define apr_uid_compare(left,right) (((left) == (right)) ? APR_SUCCESS : APR_EMISMATCH) 138 * @param left One gid to test 145 APR_DECLARE(apr_status_t) apr_gid_compare(apr_gid_t left, apr_gid_t right); 147 #define apr_gid_compare(left,right) (((left) == (right)) ? APR_SUCCESS : APR_EMISMATCH)
|
/freebsd-10.0-release/contrib/ldns/ |
H A D | rbtree.c | 64 /** rotate subtree left (to preserve redblack property) */ 112 * Rotates the node to the left. 119 node->right = right->left; 120 if (right->left != LDNS_RBTREE_NULL) 121 right->left->parent = node; 126 if (node == node->parent->left) { 127 node->parent->left = right; 134 right->left = node; 145 ldns_rbnode_t *left = node->left; local [all...] |
/freebsd-10.0-release/usr.bin/csup/ |
H A D | globtree.c | 72 struct globtree *left; member in struct:globtree 96 gt->left = NULL; 144 globtree_and(struct globtree *left, struct globtree *right) argument 148 if (left->type == GLOBTREE_FALSE || right->type == GLOBTREE_FALSE) { 149 globtree_free(left); 154 if (left->type == GLOBTREE_TRUE) { 155 globtree_free(left); 160 return (left); 163 gt->left = left; 169 globtree_or(struct globtree *left, struct globtree *right) argument [all...] |
/freebsd-10.0-release/contrib/xz/src/liblzma/lz/ |
H A D | lz_decoder.h | 132 uint32_t left = my_min(dict_avail, *len); local 133 *len -= left; 138 if (distance < left) { 144 } while (--left > 0); 150 left); 151 dict->pos += left; 162 if (copy_size < left) { 166 copy_size = left - copy_size; 171 left); 172 dict->pos += left; 203 dict_write(lzma_dict *restrict dict, const uint8_t *restrict in, size_t *restrict in_pos, size_t in_size, size_t *restrict left) argument [all...] |
/freebsd-10.0-release/contrib/ofed/libibverbs/src/ |
H A D | memory.c | 68 struct ibv_mem_node *left, *right; member in struct:ibv_mem_node 113 mm_root->left = NULL; 125 if (node->left) { 126 node = node->left; 130 while (node->parent && node == node->parent->left) 143 while (node->left) 144 node = node->left; 159 tmp = node->left; 161 node->left = tmp->right; 162 if (node->left) [all...] |
/freebsd-10.0-release/contrib/binutils/libiberty/ |
H A D | splay-tree.c | 83 deallocated, we just need to process left and right. */ 85 if (active->left) 87 KDEL (active->left->key); 88 VDEL (active->left->value); 89 active->left->key = (splay_tree_key)pending; 90 pending = (splay_tree_node)(active->left); 109 /* Rotate the edge joining the left child N with its parent P. PP is the 118 p->left = tmp; 129 tmp = n->left; 130 n->left 353 splay_tree_node left, right; local [all...] |
/freebsd-10.0-release/contrib/gcclibs/libiberty/ |
H A D | splay-tree.c | 83 deallocated, we just need to process left and right. */ 85 if (active->left) 87 KDEL (active->left->key); 88 VDEL (active->left->value); 89 active->left->key = (splay_tree_key)pending; 90 pending = (splay_tree_node)(active->left); 109 /* Rotate the edge joining the left child N with its parent P. PP is the 118 p->left = tmp; 129 tmp = n->left; 130 n->left 353 splay_tree_node left, right; local [all...] |