HomeSort by: relevance | last modified time | path
    Searched refs:trail (Results 1 - 25 of 34) sorted by relevancy

1 2

  /src/external/mpl/dhcp/dist/keama/tests/samples/
runone.sh 14 trail=$(expr $file : ".*6$")
16 if [ $trail -eq 0 ]; then
  /src/external/mpl/dhcp/dist/keama/tests/
runone.sh 32 trail=
34 trail=$(expr $full : ".*\.in\(.\)")
36 trail=$(expr $full : ".*\.err\(.\)")
43 case $trail in
55 *) echo "unrecognized trail '$trail' in '$full'" >&2; exit 1;;
59 base=$(basename $full .err$trail)
62 echo "required trail ([45FP]) in '$full'" >&2
65 base=$(basename $full .in$trail)
  /src/external/bsd/jemalloc.old/dist/src/
large.c 110 extent_t *trail = extent_split_wrapper(tsdn, arena, local
113 if (trail == NULL) {
118 large_dalloc_maybe_junk(extent_addr_get(trail),
119 extent_size_get(trail));
122 arena_extents_dirty_dalloc(tsdn, arena, &extent_hooks, trail);
153 extent_t *trail; local
155 if ((trail = extents_alloc(tsdn, arena, &extent_hooks,
158 || (trail = extents_alloc(tsdn, arena, &extent_hooks,
165 if ((trail = extent_alloc_wrapper(tsdn, arena, &extent_hooks,
175 if (extent_merge_wrapper(tsdn, arena, &extent_hooks, extent, trail)) {
    [all...]
extent.c 911 * it, this splits off lead and trail extents, leaving extent pointing to an
913 * This function doesn't put lead or trail into any extents_t; it's the caller's
918 * Split successfully. lead, extent, and trail, are modified to extents
930 * None of lead, extent, or trail are valid.
939 extent_t **extent, extent_t **lead, extent_t **trail,
954 *trail = NULL;
971 /* Split the trail. */
973 *trail = extent_split_impl(tsdn, arena, r_extent_hooks, *extent,
976 if (*trail == NULL) {
1018 extent_t *trail; local
1300 extent_t *trail; local
1989 extent_t *trail = extent_alloc(tsdn, arena); local
    [all...]
  /src/external/gpl2/rcs/dist/src/
rcsrev.c 535 register struct hshentry * next, * trail; local
576 trail = 0;
580 ) trail = next;
584 if (!trail) {
589 while (next!=trail) {
612 trail = next;
617 (cmpnumfld(revno,trail->num,field+1) !=0)){
622 if (date && cmpdate(date,trail->date)<0) {
624 trail->num,
625 date2str(trail->date, datebuf
    [all...]
co.c 582 { register struct rcslock * next, * trail; local
589 trail = &dummy;
601 trail=next;
606 trail->nextlock=next->nextlock;
ci.c 1136 register struct rcslock *next, **trail; local
1140 for (trail = &Locks; (next = *trail); trail = &next->nextlock)
1144 *trail = next->nextlock;
rcs.c 1088 register struct rcslock *next, **trail; local
1092 for (trail = &Locks; (next = *trail); trail = &next->nextlock)
1104 *trail = next->nextlock;
rcsedit.c 1704 register struct rcslock *next, **trail, **found; local
1707 for (trail = &Locks; (next = *trail); trail = &next->nextlock)
1713 found = trail;
  /src/external/gpl3/gcc/dist/gcc/config/rs6000/
rbtree.cc 111 struct rbt_string_node *trail = t->rbt_nil; local
115 trail = curr;
126 fresh->par = trail;
128 if (trail == t->rbt_nil)
130 else if (strcmp (fresh->str, trail->str) < 0)
131 trail->left = fresh;
133 trail->right = fresh;
  /src/external/gpl3/gcc.old/dist/gcc/config/rs6000/
rbtree.cc 111 struct rbt_string_node *trail = t->rbt_nil; local
115 trail = curr;
126 fresh->par = trail;
128 if (trail == t->rbt_nil)
130 else if (strcmp (fresh->str, trail->str) < 0)
131 trail->left = fresh;
133 trail->right = fresh;
  /src/games/worms/
worms.c 203 int CO, LI, last, bottom, ch, number, trail; local
223 trail = ' ';
247 if (trail == ' ')
248 trail = '.';
250 trail = ' ';
356 if (trail == ' ')
357 trail = '.';
359 trail = ' ';
518 mvaddch(y1, x1, trail);
  /src/lib/libc/time/
strftime.c 856 int trail; local
859 trail = a % DIVISOR + b % DIVISOR;
860 lead = a / DIVISOR + b / DIVISOR + trail / DIVISOR;
861 trail %= DIVISOR;
862 if (trail < 0 && lead > 0) {
863 trail += DIVISOR;
865 } else if (lead < 0 && trail > 0) {
866 trail -= DIVISOR;
870 if (lead == 0 && trail < 0)
875 pt = _conv(((trail < 0) ? -trail : trail), "%02d", pt, ptlim
    [all...]
zdump.c 1219 int trail; local
1236 trail = timeptr->tm_year % DIVISOR + TM_YEAR_BASE % DIVISOR;
1238 trail / DIVISOR;
1239 trail %= DIVISOR;
1240 if (trail < 0 && lead > 0) {
1241 trail += DIVISOR;
1243 } else if (lead < 0 && trail > 0) {
1244 trail -= DIVISOR;
1248 printf("%d", trail);
1249 else printf("%d%d", lead, ((trail < 0) ? -trail : trail))
    [all...]
  /src/external/bsd/jemalloc/dist/src/
pac.c 202 edata_t *trail = ecache_alloc(tsdn, pac, ehooks, &pac->ecache_dirty, local
204 if (trail == NULL) {
205 trail = ecache_alloc(tsdn, pac, ehooks, &pac->ecache_muzzy,
208 if (trail == NULL) {
209 trail = ecache_alloc_grow(tsdn, pac, ehooks,
214 if (trail == NULL) {
217 if (extent_merge_wrapper(tsdn, pac, ehooks, edata, trail)) {
218 extent_dalloc_wrapper(tsdn, pac, ehooks, trail);
240 edata_t *trail = extent_split_wrapper(tsdn, pac, ehooks, edata, local
242 if (trail == NULL)
    [all...]
extent.c 451 * it, this splits off lead and trail extents, leaving edata pointing to an
453 * This function doesn't put lead or trail into any ecache; it's the caller's
458 * Split successfully. lead, edata, and trail, are modified to extents
470 * None of lead, edata, or trail are valid.
478 edata_t **edata, edata_t **lead, edata_t **trail,
491 *trail = NULL;
508 /* Split the trail. */
511 *trail = extent_split_impl(tsdn, pac, ehooks, *edata, size,
513 if (*trail == NULL) {
539 edata_t *trail; local
695 edata_t *trail; local
1190 edata_t *trail = edata_cache_get(tsdn, pac->edata_cache); local
    [all...]
emap.c 285 edata_t *edata, size_t size_a, edata_t *trail, size_t size_b) {
299 emap_rtree_leaf_elms_lookup(tsdn, emap, rtree_ctx, trail, false, true,
311 edata_t *lead, size_t size_a, edata_t *trail, size_t size_b) {
323 prepare->trail_elm_b, trail, SC_NSIZES, /* slab */ false);
328 edata_t *lead, edata_t *trail) {
332 emap_rtree_leaf_elms_lookup(tsdn, emap, rtree_ctx, trail, true, false,
338 edata_t *lead, edata_t *trail) {
  /src/sys/dev/pcmcia/
if_cnwioctl.h 99 struct cnwtrail trail[128]; member in struct:cnwitrail
110 #define SIOCGCNWTRAIL _IOWR('i', 249, struct cnwitrail)/* get trail */
  /src/external/gpl3/gcc/dist/libcpp/
mkdeps.cc 123 /* Apply Make quoting to STR, TRAIL. Note that it's not possible to
130 munge (const char *str, const char *trail = nullptr)
136 for (; str; str = trail, trail = nullptr)
375 QUOTE apply quoting. Append TRAIL. */
379 bool quote = true, const char *trail = NULL)
382 name = munge (name, trail);
407 const char *trail = NULL)
410 col = make_write_name (vec[ix], fp, col, colmax, ix >= quote_lwm, trail);
  /src/external/gpl3/gcc.old/dist/libcpp/
mkdeps.cc 116 /* Apply Make quoting to STR, TRAIL. Note that it's not possible to
123 munge (const char *str, const char *trail = nullptr)
129 for (; str; str = trail, trail = nullptr)
347 QUOTE apply quoting. Append TRAIL. */
351 bool quote = true, const char *trail = NULL)
354 name = munge (name, trail);
379 const char *trail = NULL)
382 col = make_write_name (vec[ix], fp, col, colmax, ix >= quote_lwm, trail);
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
emap.h 125 * In all cases, "lead" refers to the lower-addressed extent, and trail to the
130 edata_t *edata, size_t size_a, edata_t *trail, size_t size_b);
132 edata_t *lead, size_t size_a, edata_t *trail, size_t size_b);
134 edata_t *lead, edata_t *trail);
136 edata_t *lead, edata_t *trail);
  /src/external/bsd/jemalloc/include/jemalloc/internal/
emap.h 125 * In all cases, "lead" refers to the lower-addressed extent, and trail to the
130 edata_t *edata, size_t size_a, edata_t *trail, size_t size_b);
132 edata_t *lead, size_t size_a, edata_t *trail, size_t size_b);
134 edata_t *lead, edata_t *trail);
136 edata_t *lead, edata_t *trail);
  /src/bin/pax/
pax.h 210 int (*trail) /* returns 0 if a valid trailer, -1 if not */ member in struct:__anon31
  /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++23/
print.cc 246 char16_t trail = 0xDC00 + (code_point & 0x3FF); local
248 out.push_back(trail);
  /src/libexec/makewhatis/
makewhatis.c 747 char *trail; local
750 if ((trail = findwhitespace(sect)) != NULL)
751 *trail++ = '\0';
758 if (trail == NULL) {
763 length = strlen(trail);
764 (void) memmove(to, trail, length + 1);

Completed in 36 milliseconds

1 2