/osnet-11/usr/src/lib/libdevinfo/ |
H A D | devinfo_realpath.c | 74 * in which case the path which caused trouble is left in (resolved). 88 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; local 98 left_len = strlcpy(left, path + 1, sizeof (left)); 105 left_len = strlcpy(left, path, sizeof (left)); 107 if (left_len >= sizeof (left) || resolved_len >= PATH_MAX) { 113 * Iterate over path components in `left'. 117 * Extract the next path component and adjust `left' 120 p = strchr(left, '/'); [all...] |
/osnet-11/usr/src/grub/grub2/grub-core/lib/libgcrypt-grub/cipher/ |
H A D | des.c | 179 * and are rotated one bit to the left. 301 * Numbers of left shifts per round for encryption subkeys. 402 * to the left. 404 #define INITIAL_PERMUTATION(left, temp, right) \ 405 DO_PERMUTATION(left, temp, right, 4, 0x0f0f0f0f) \ 406 DO_PERMUTATION(left, temp, right, 16, 0x0000ffff) \ 407 DO_PERMUTATION(right, temp, left, 2, 0x33333333) \ 408 DO_PERMUTATION(right, temp, left, 8, 0x00ff00ff) \ 410 temp = (left ^ right) & 0xaaaaaaaa; \ 412 left 488 u32 left, right, work; local 617 u32 left, right, work; local 706 u32 left, right, work; local 759 int i, left, right, middle, cmp_result; local [all...] |
/osnet-11/usr/src/lib/libntfs/common/libntfs/ |
H A D | bitmap.c | 63 s64 bufsize, br, left = count; local 100 while ((bit & 7) && left--) { 110 /* Loop until @left reaches zero. */ 113 bit = left & 7; 116 if (left > 0 && bit) { 117 lastbyte_pos = ((left + 7) >> 3) + firstbyte; 130 br = ntfs_attr_pread(na, (start_bit + left) >> 142 while (bit && left--) { 177 left -= tmp; 178 if (bufsize > (tmp = (left [all...] |
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Storable/t/ |
H A D | st-dump.pl | 21 my ($num, $left, $right, $name) = @_; 22 my $ok = ((defined $left) ? $left == $right : undef); 25 if (!defined $left) { 27 } elsif ($left !~ tr/0-9//c) { 28 print "# Got $left\n"; 30 $left =~ s/([^-a-zA-Z0-9_+])/sprintf "\\%03o", ord $1/ge; 31 print "# Got \"$left\"\n";
|
/osnet-11/usr/src/lib/libast/common/cdt/ |
H A D | dtlist.c | 52 r = r->left; 99 { r->left = t->left; 100 t->left->right = r; 102 t->left = r; 110 { r->left = t->left; 111 t->left = r; 113 else r->left = r; 118 { t->left [all...] |
H A D | dthdr.h | 42 #define left hl._left macro 68 #define rrotate(x,y) ((x)->left = (y)->right, (y)->right = (x)) 69 #define lrotate(x,y) ((x)->right = (y)->left, (y)->left = (x)) 70 #define rlink(r,x) ((r) = (r)->left = (x) )
|
H A D | dttree.c | 61 { while((t = root->left) ) 81 { while((t = root->left) ) 90 /* note that link.right is LEFT tree and link.left is RIGHT tree */ 102 l->right = root->left; 103 r->left = root->right; 133 if(!(t = cmp < 0 ? t->left : t->right) ) 141 { t = root->left; 145 root = t->left; 163 root = t->left; 174 { if((t = root->left) ) [all...] |
H A D | dtrenew.c | 50 { if(!e->right ) /* make left child the new root */ 51 dt->data->here = e->left; 55 /* merge left subtree to right subtree */ 56 if(e->left) 57 { for(t = e->right; t->left; t = t->left) 59 t->left = e->left;
|
H A D | dtflatten.c | 59 { while((t = r->left) ) 62 { if((t = r->left) ) 64 while((t = r->left) );
|
H A D | dtsize.c | 35 { return e ? treecount(e->left) + treecount(e->right) + 1 : 0;
|
/osnet-11/usr/src/grub/grub2/grub-core/lib/libgcrypt/cipher/ |
H A D | des.c | 181 * and are rotated one bit to the left. 303 * Numbers of left shifts per round for encryption subkeys. 408 * to the left. 410 #define INITIAL_PERMUTATION(left, temp, right) \ 411 DO_PERMUTATION(left, temp, right, 4, 0x0f0f0f0f) \ 412 DO_PERMUTATION(left, temp, right, 16, 0x0000ffff) \ 413 DO_PERMUTATION(right, temp, left, 2, 0x33333333) \ 414 DO_PERMUTATION(right, temp, left, 8, 0x00ff00ff) \ 416 temp = (left ^ right) & 0xaaaaaaaa; \ 418 left 494 u32 left, right, work; local 623 u32 left, right, work; local 740 u32 left, right, work; local 793 int i, left, right, middle, cmp_result; local [all...] |
/osnet-11/usr/src/lib/libresolv2/common/isc/ |
H A D | tree.c | 116 RET(tree_srch(&(**ppr_tree).left, 160 if (!tree_trav(&(**ppr_tree).left, pfi_uar)) 173 tree_mung(&(**ppr_tree).left, pfv_uar); 199 (*ppr)->left = NULL; 212 /* if LESS, prepare to move to the left. 215 MSG("LESS. sprouting left.") 216 sub = sprout(&(*ppr)->left, p_data, pi_balance, 218 if (sub && *pi_balance) { /*%< left branch has grown */ 219 MSG("LESS: left branch has grown") 228 /* balance WAS okay; now left branc [all...] |
/osnet-11/usr/src/lib/libc/port/gen/ |
H A D | strlcat.c | 44 size_t left = dstsize; local 49 while (left-- != 0 && *df != '\0')
|
/osnet-11/usr/src/lib/libcurses/screen/ |
H A D | overlap.c | 56 top, bottom, left, right; local 72 left = _MAX(sbx, dbx); right = _MIN(sex, dex); 74 sby = top - sby; sbx = left - sbx; 76 dby = top - dby; dbx = left - dbx;
|
H A D | slk_set.c | 54 * f: 0, 1, 2 for left, center, right-justification 61 int len, slklen = slk->_len, left; local 85 left = 0; 87 left = (slklen - len) / ((f == 1) ? 2 : 1); 89 (void) memcpy(nlab + left, lab, len);
|
H A D | slk_start.c | 218 int i, k, n, spread, left, begadd; local 229 left = (COLS-(n + 1)) % (_ngroups - 1); 230 begadd = (_ngroups / 2) - (left / 2); 236 if (left > 0 && i > begadd) { 238 left--;
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/t/op/ |
H A D | qq.t | 14 my($left, $right) = @_; 16 if ($left eq $right) { 21 foreach ($left, $right) { 30 ), $test++, $left, $right;
|
/osnet-11/usr/src/lib/libcryptoutil/common/ |
H A D | keyfile.c | 111 size_t left = filesize; local 114 for (/* */; left > 0; marker += nread, left -= nread) { 116 nread = read(fd, marker, left); 136 filesize -= left;
|
H A D | random.c | 105 size_t left = dlen; local 108 for (err = 0; left > 0 && nread != -1; marker += nread, left -= nread) { 109 if ((nread = read(fd, marker, left)) < 0) { 120 return (err != 0 ? err : dlen - left); 130 size_t left = dlen; local 133 for (err = 0; left > 0 && nwrite != -1; marker += nwrite, 134 left -= nwrite) { 135 if ((nwrite = write(fd, marker, left)) < 0) { 146 return (err != 0 ? err : dlen - left); [all...] |
/osnet-11/usr/src/lib/libeti/menu/common/ |
H A D | link.c | 44 int left, up; local 69 /* Set up left and right links at edge of menu */ 73 left = n + r; 74 if (left >= Nitems(m)) { 75 left -= Rows(m); 77 Left(IthItem(m, n)) = IthItem(m, left); 78 Right(IthItem(m, left)) = IthItem(m, n); 101 int left, up; local 134 /* Setup left and right links at edge of menu */ 137 left [all...] |
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ |
H A D | cc_runtime.h | 25 if (PL_tainting && PL_tainted && (!SvGMAGICAL(left) || !SvSMAGICAL(left) || \ 26 !((mg=mg_find(left, PERL_MAGIC_taint)) && mg->mg_len & 1)))\
|
/osnet-11/usr/src/lib/libshell/common/sh/ |
H A D | timers.c | 91 static double left; local 93 left = 0; 144 if(tpmin && (left==0 || (tp && tpmin->wakeup < (now+left)))) 146 if(left==0) 148 left = setalarm(tpmin->wakeup-now); 149 if(left && (now+left) < tpmin->wakeup) 150 setalarm(left); 152 left [all...] |
/osnet-11/usr/src/lib/libeti/form/common/ |
H A D | fieldtype.c | 49 #define TypeL(t) ((t)->left) 67 (FIELDTYPE *) 0, /* left */ 96 link_fieldtype(FIELDTYPE *left, FIELDTYPE *right) argument 100 if ((left || right) && Alloc(t, FIELDTYPE)) { 105 if (Status(left, ARGS) || Status(right, ARGS)) 108 if (Status(left, CHOICE) || Status(right, CHOICE)) 111 TypeL(t) = left; 113 IncrType(left); /* increment reference count */
|
/osnet-11/usr/src/lib/libresolv2/include/isc/ |
H A D | tree.h | 44 struct tree_s *left, *right; member in struct:tree_s
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Socket/t/ |
H A D | socketpair.t | 91 my @left = ("hello ", "world\n"); 94 foreach (@left) { 95 # is (syswrite (LEFT, $_), length $_, "write " . _qq ($_) . " to left"); 96 is (syswrite (LEFT, $_), length $_, "syswrite to left"); 107 is (read (LEFT, $buffer, length $expect), length $expect, "read on left"); 109 $expect = join '', @left; 114 ok (shutdown(LEFT, SHUT_WR), "shutdown left for writing"); 135 = sub { warn "syswrite to left didn't fail within 3 seconds" }; 141 is ($ans, undef, "syswrite to shutdown left should fail"); 157 ok (!eof LEFT, "left i [all...] |