Searched refs:left (Results 1 - 25 of 174) sorted by relevance

1234567

/barrelfish-2018-10-04/usr/bench/mdb_bench/
H A Dold_mdb.c26 N(cte)->left = cte;
44 N(cte)->left = N(curr)->left;
47 N(N(cte)->left)->right = cte;
48 N(N(cte)->right)->left = cte;
55 old_start = N(cte)->right = N(cte)->left = NULL;
62 N(N(cte)->right)->left = N(cte)->left;
63 N(N(cte)->left)->right = N(cte)->right;
65 N(cte)->right = N(cte)->left
[all...]
/barrelfish-2018-10-04/lib/libc/stdlib/
H A Drealpath.c48 * 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...]
/barrelfish-2018-10-04/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/
H A DExtent.java52 * utility constructor to work with left and right values. creates a pair itself
53 * @param left
56 public Extent(double left, double right) { argument
58 add(new DPair(left,right));
71 * @param left
74 public void addFirst(double left, double right) { argument
75 addFirst(new DPair(left,right));
80 * @param left
83 protected void add(double left, double right) { argument
84 add(new DPair(left,righ
[all...]
/barrelfish-2018-10-04/usr/drivers/lpc_kbd/
H A Dlpc_kbd.h25 bool left, bool middle, bool right);
H A Dmain.c40 bool left, bool middle, bool right)
45 left, middle, right);
39 mouse_event(int32_t xdelta, int32_t ydelta, bool left, bool middle, bool right) argument
/barrelfish-2018-10-04/lib/acpica/source/compiler/
H A Ddtparser.y170 %left <op> EXPOP_LOGICAL_OR
171 %left <op> EXPOP_LOGICAL_AND
172 %left <op> EXPOP_OR
173 %left <op> EXPOP_XOR
174 %left <op> EXPOP_AND
175 %left <op> EXPOP_EQUAL EXPOP_NOT_EQUAL
176 %left <op> EXPOP_GREATER EXPOP_LESS EXPOP_GREATER_EQUAL EXPOP_LESS_EQUAL
177 %left <op> EXPOP_SHIFT_RIGHT EXPOP_SHIFT_LEFT
178 %left <op> EXPOP_ADD EXPOP_SUBTRACT
179 %left <o
[all...]
H A Dprparser.y170 %left <op> EXPOP_LOGICAL_OR
171 %left <op> EXPOP_LOGICAL_AND
172 %left <op> EXPOP_OR
173 %left <op> EXPOP_XOR
174 %left <op> EXPOP_AND
175 %left <op> EXPOP_EQUAL EXPOP_NOT_EQUAL
176 %left <op> EXPOP_GREATER EXPOP_LESS EXPOP_GREATER_EQUAL EXPOP_LESS_EQUAL
177 %left <op> EXPOP_SHIFT_RIGHT EXPOP_SHIFT_LEFT
178 %left <op> EXPOP_ADD EXPOP_SUBTRACT
179 %left <o
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/engines/ccgost/
H A Dgosthash.c62 static int add_blocks(int n,byte *left, const byte *right) argument
69 sum=(int)left[i]+(int)right[i]+carry;
70 left[i]=sum & 0xff;
172 ctx->left=0;
185 if (ctx->left)
188 unsigned int add_bytes = 32-ctx->left;
193 memcpy(&(ctx->remainder[ctx->left]),block,add_bytes);
194 ctx->left+=add_bytes;
195 if (ctx->left<32)
203 ctx->left
[all...]
H A Dgosthash.h25 int left; member in struct:gost_hash_ctx
/barrelfish-2018-10-04/lib/mdb/
H A Dmdb_tree.c203 printf("%s%p{left=%p,right=%p,end=0x%08"PRIxGENPADDR",end_root=%"PRIu8","
207 cte, node->left, node->right, node->end, node->end_root,
217 // Print a tree with root on the left, the smallest element at the top and the
235 if (node->left) {
236 if (node->left == cte) {
240 mdb_dump(node->left, indent+1);
275 if (node->level > 0 && !(node->left && node->right)) {
278 if (node->left && !(N(node->left)->level < node->level)) {
289 if (node->right && N(node->right)->left
447 struct cte *left = N(node)->left; local
[all...]
/barrelfish-2018-10-04/include/mdb/
H A Dtypes.h22 struct cte *left, *right; member in struct:mdbnode
/barrelfish-2018-10-04/lib/zlib/
H A Dinftrees.c46 int left; /* number of prefix codes available */ local
131 left = 1;
133 left <<= 1;
134 left -= count[len];
135 if (left < 0) return -1; /* over-subscribed */
137 if (left > 0 && (type == CODES || max != 1))
270 left = (int)(1 << curr);
272 left -= count[curr + drop];
273 if (left <= 0) break;
275 left <<
[all...]
H A Dinfback.c122 left = strm->avail_out; \
133 strm->avail_out = left; \
203 if (left == 0) { \
205 left = state->wsize; \
206 state->whave = left; \
207 if (out(out_desc, put, left)) { \
251 unsigned have, left; /* available input and output */ local
278 left = state->wsize;
337 if (copy > left) copy = left;
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/ssl/
H A Ds3_pkt.c35 * The word 'cryptographic' can be left out if the rouines from the library
132 int i,len,left; local
144 left = rb->left;
153 if (left == 0)
155 else if (align != 0 && left >= SSL3_RT_HEADER_LENGTH)
170 memmove (rb->buf+align,pkt,left);
184 if (left > 0 && n > left)
185 n = left;
[all...]
/barrelfish-2018-10-04/lib/libc/gen/
H A Dsyslog.c92 int left; member in struct:bufcookie
106 if (len > h->left) {
108 len = h->left;
113 h->left -= len;
168 tbuf_cookie.left = sizeof(tbuf);
182 stdp = tbuf + (sizeof(tbuf) - tbuf_cookie.left);
199 fmt_cookie.left = sizeof(fmt_cpy) - 1;
239 cnt = sizeof(tbuf) - tbuf_cookie.left;
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/
H A Dtkabortbutton63 pack .abort -side left -expand 1 -fill x
/barrelfish-2018-10-04/lib/octopus/parser/
H A Dast.c59 free_ast(p->u.pn.left);
97 if (strcmp((*attr)->u.an.attr->u.pn.left->u.in.str, name) == 0) {
114 struct ast_object* left = pair->u.pn.left; local
116 if (strcmp(left->u.in.str, name) == 0) {
H A Dtest_parser.c138 assert(p->u.pn.left != NULL);
141 attribute_name = p->u.pn.left;
143 translate(p->u.pn.left);
236 struct ast_object* left = pair->u.pn.left; local
238 assert(left != NULL);
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/chr/
H A Ddata.pl5 % So about 1% of the signal is left after a couple of walls,
/barrelfish-2018-10-04/lib/compiler-rt/builtins/
H A Dfp_fixint_impl.inc36 // Otherwise, shift left.
H A Dfp_fixuint_impl.inc34 // Otherwise, shift left.
/barrelfish-2018-10-04/lib/lwip2/src/netif/ppp/polarssl/
H A Dmd4.c195 unsigned long left; local
200 left = ctx->total[0] & 0x3F;
201 fill = 64 - left;
209 if( left && ilen >= fill )
211 MEMCPY( (void *) (ctx->buffer + left),
216 left = 0;
228 MEMCPY( (void *) (ctx->buffer + left),
/barrelfish-2018-10-04/include/lwip2/netif/ppp/polarssl/
H A Dmd4.c195 unsigned long left; local
200 left = ctx->total[0] & 0x3F;
201 fill = 64 - left;
209 if( left && ilen >= fill )
211 MEMCPY( (void *) (ctx->buffer + left),
216 left = 0;
228 MEMCPY( (void *) (ctx->buffer + left),
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/widget/
H A Dutil-tk.tcl141 foreach {x y x1 y1} $box {top btm} [$c yview] {left right} [$c xview] \
143 set xpos [expr {(($x1+$x)/2.0)/$xmax - ($right-$left)/2.0}]
203 pack $base.f.l -side left
204 pack $base.f.e $base.opt.c $base.opt.r -side left -fill both -expand 1
211 -side left -fill both
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dcolgen.tex51 $K_{0}=\sum_{i=1}^{m}\left\lceil b_{i}/\left\lfloor
72 \left.\begin{array}{@{}l}
91 \left.\begin{array}{@{}l}
92 %\left.\begin{array}{@{}l}
95 %\left.\begin{array}{@{}l}
98 %\left.\begin{array}{@{}l}
100 \left\{0,\ldots,l\right\}\\
101 \left\{0,\ldots,h_{i}\right\}\quad\forall i\\
103 %\left
[all...]

Completed in 291 milliseconds

1234567