Searched refs:segments (Results 1 - 5 of 5) sorted by relevance

/barrelfish-master/lib/libc/net/
H A Drthdr.c275 inet6_rth_space(int type, int segments) argument
279 if ((segments >= 0) && (segments <= 127))
280 return (((segments * 2) + 1) << 3);
288 inet6_rth_init(void *bp, socklen_t bp_len, int type, int segments) argument
296 if (bp_len < inet6_rth_space(IPV6_RTHDR_TYPE_0, segments))
299 if ((segments < 0) || (segments > 127))
304 rth0->ip6r0_len = segments * 2;
326 /* Don't exceed the number of stated segments */
345 int i, segments; local
[all...]
/barrelfish-master/usr/eclipseclp/icparc_solvers/
H A Deplex_relax.pl195 % Wrap the remaining complete segments in this chunk.
215 % Wrap the complete segments of the final chunk.
588 % Both segments going up.
665 % Both segments going down.
880 % So for segments which span a zero coordinate (which would
948 % So for segments which span a zero coordinate (which would
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Dgc.tex24 \item It is incremental, based on choicepoint segments
/barrelfish-master/doc/022-armv8/
H A Dreport.tex724 The currently-executing CPU driver's text and data segments.
/barrelfish-master/lib/tommath/
H A Dtommath.tex471 segments of code littered throughout the source. This clean and uncluttered approach to the library means that a
478 very hard. GMP has many conditional code segments which also hinder tracing.

Completed in 174 milliseconds