Searched refs:middle (Results 1 - 25 of 30) sorted by relevance

12

/freebsd-10.0-release/usr.bin/gprof/
H A Dlookup.c50 register long middle; local
61 middle = ( high + low ) >> 1;
62 if ( nl[ middle ].value <= address && nl[ middle+1 ].value > address ) {
69 if (nl[middle].name[0] == '$' &&
70 nl[middle-1].value == nl[middle].value)
71 middle--;
74 return &nl[ middle ];
76 if ( nl[ middle ]
[all...]
/freebsd-10.0-release/contrib/gperf/src/
H A Dkeyword-list.cc132 /* Determine a list node in the middle. */
133 Keyword_List *middle = list; local
140 middle = middle->rest();
148 Keyword_List *right_half = middle->rest();
149 middle->rest() = NULL;
/freebsd-10.0-release/contrib/gcclibs/libiberty/
H A Dgetopt.c323 int middle = last_nonopt;
354 while (top > middle && middle > bottom)
356 if (top - middle > middle - bottom)
359 int len = middle - bottom;
366 argv[bottom + i] = argv[top - (middle - bottom) + i];
367 argv[top - (middle - bottom) + i] = tem;
368 SWAP_FLAGS (bottom + i, top - (middle - bottom) + i);
376 int len = top - middle;
320 int middle = last_nonopt; local
[all...]
H A Dregex.c3966 inserting into the middle of the pattern --
5526 int middle = (lower + upper) / 2;
5527 if (middle == lower || middle == upper)
5529 if (offset_buffer[middle] > length)
5530 upper = middle;
5531 else if (offset_buffer[middle] < length)
5532 lower = middle;
5534 return middle;
5509 int middle = (lower + upper) / 2; local
/freebsd-10.0-release/contrib/ldns/ldns/
H A Ddname.h167 * check if middle lays in the interval defined by prev and next
168 * prev <= middle < next. This is usefull for nsec checking
170 * \param[in] middle the dname to check
172 * return 0 on error or unknown, -1 when middle is in the interval, +1 when not
174 int ldns_dname_interval(const ldns_rdf *prev, const ldns_rdf *middle, const ldns_rdf *next);
/freebsd-10.0-release/contrib/byacc/
H A Dlalr.c250 int middle; local
259 middle = (low + high) >> 1;
260 s = from_state[middle];
262 return (Value_t) (middle);
264 low = middle + 1;
266 high = middle - 1;
/freebsd-10.0-release/contrib/wpa/src/ap/
H A Dap_config.c559 int start, end, middle, res; local
565 middle = (start + end) / 2;
566 res = os_memcmp(list[middle].addr, addr, ETH_ALEN);
569 *vlan_id = list[middle].vlan_id;
573 start = middle + 1;
575 end = middle - 1;
/freebsd-10.0-release/contrib/llvm/utils/TableGen/
H A DCodeEmitterGen.cpp78 unsigned middle = (numBits + 1) / 2; local
79 NewBits[middle] = BI->getBit(middle);
/freebsd-10.0-release/contrib/ldns/
H A Ddname.c479 /* nsec test: does prev <= middle < next
485 ldns_dname_interval(const ldns_rdf *prev, const ldns_rdf *middle, argument
491 assert(ldns_rdf_get_type(middle) == LDNS_RDF_TYPE_DNAME);
494 prev_check = ldns_dname_compare(prev, middle);
495 next_check = ldns_dname_compare(middle, next);
/freebsd-10.0-release/tools/test/netfibs/
H A Dforwarding.sh35 # left ------------------------- middle ------------------------- right
46 # IFACEFAR is only relevant on the middle (forwarding) node and will be the
60 # This is the initiator and connected middle node.
63 # This is the far end middle node and receiver side.
85 middle) ;;
87 *) echo "ERROR: invalid node name '${node}'. Must be left, middle or" \
159 middle) ifconfig ${IFACE} inet6 ${MIDDLELEFTADDR}/64 -alias \
197 middle) ifconfig ${IFACE} inet6 ${MIDDLELEFTADDR}/64 -alias
244 middle) _reachability_check ${LEFTADDR}
356 # numbers from the middle nod
[all...]
/freebsd-10.0-release/contrib/nvi/vi/
H A Dvs_refresh.c295 goto middle;
317 goto middle;
353 /* It's not close, just put the line in the middle. */
354 goto middle;
360 * in the middle of the screen.
370 middle: if (vs_sm_fill(sp, LNO, P_MIDDLE))
784 * any special games. We try to put the ruler in the middle and the
H A Dvs_smap.c221 goto middle;
245 middle: p = HMAP + sp->t_rows / 2;
1133 * Return the line/column of the top, middle or last line on the screen.
1165 * If the screen isn't filled, find the middle of what's
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_client/
H A Dblame.c235 struct blame *middle; local
236 middle = blame_create(chain, rev, start);
238 middle->next = insert;
240 point->next = middle;
/freebsd-10.0-release/usr.bin/compress/
H A Dzopen.c251 goto middle;
283 middle: for (i = 0; count--;) {
389 /* Get any 8 bit parts in the middle (<=1 for up to 16 bits). */
473 goto middle;
547 middle: do {
618 /* Get any 8 bit parts in the middle (<=1 for up to 16 bits). */
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_fs_fs/
H A Dtemp_serializer.c852 apr_size_t middle; local
854 for (middle = upper / 2; lower < upper; middle = (upper + lower) / 2)
857 svn_temp_deserializer__ptr(entries, (const void *const *)&entries[middle]);
863 lower = middle + 1;
865 upper = middle;
/freebsd-10.0-release/contrib/gcclibs/libcpp/
H A Dexpr.c1426 cpp_num_part middle[2], temp;
1431 middle[0] = LOW_PART (lhs) * HIGH_PART (rhs);
1432 middle[1] = HIGH_PART (lhs) * LOW_PART (rhs);
1435 result.low += LOW_PART (middle[0]) << (PART_PRECISION / 2);
1440 result.low += LOW_PART (middle[1]) << (PART_PRECISION / 2);
1444 result.high += HIGH_PART (middle[0]);
1445 result.high += HIGH_PART (middle[1]);
1425 cpp_num_part middle[2], temp; local
/freebsd-10.0-release/sys/fs/ext2fs/
H A Dext2_htree.c237 struct ext2fs_htree_entry *entp, *start, *end, *middle, *found; local
288 middle = start + (end - start) / 2;
289 if (ext2_htree_get_hash(middle) > hash_major)
290 end = middle - 1;
292 start = middle + 1;
/freebsd-10.0-release/usr.bin/gzip/
H A Dzuncompress.c229 goto middle;
303 middle: do {
383 /* Get any 8 bit parts in the middle (<=1 for up to 16 bits). */
/freebsd-10.0-release/release/picobsd/tinyware/msh/
H A Dsh4.c29 _PROTOTYPE(static char *generate, (char *start1, char *end1, char *middle, char *end ));
531 * start..end1 / middle end
535 generate(start1, end1, middle, end)
538 char *middle, *end;
543 p = op = space((int)(end1-start1)+strlen(middle)+strlen(end)+2);
546 for (xp = middle; (*op++ = *xp++) != '\0';)
/freebsd-10.0-release/contrib/binutils/gas/config/
H A Dtc-s390.c227 int middle, low, high; local
235 middle = (low + high) / 2;
236 cmp = strcasecmp (name, regs[middle].name);
238 high = middle - 1;
240 low = middle + 1;
242 return regs[middle].value;
/freebsd-10.0-release/contrib/gcclibs/libmudflap/
H A Dmf-runtime.c2446 unsigned middle = low + (high - low) / 2; local
2447 mfsplay_tree_node n = array[middle];
2451 if (low + 1 <= middle)
2452 n->left = mfsplay_tree_rebalance_helper2 (array, low, middle - 1);
2456 if (middle + 1 <= high)
2457 n->right = mfsplay_tree_rebalance_helper2 (array, middle + 1, high);
/freebsd-10.0-release/contrib/flex/
H A Dscan.l528 /* We're in the middle of a (?x: ) pattern. */
544 /* We're in the middle of a (?x: ) pattern. */
559 /* We're in the middle of a (?x: ) pattern. */
581 /* We're in the middle of a (?x: ) pattern. */
/freebsd-10.0-release/contrib/libyaml/doc/html/
H A Ddoxygen.css219 vertical-align: middle;
240 vertical-align: middle;
/freebsd-10.0-release/contrib/gcc/
H A Dvarasm.c1492 /* We could have switched section in the middle of the function. */
6112 unsigned int begin, middle, end;
6162 middle = (end + begin) / 2;
6163 anchor = VEC_index (rtx, block->anchors, middle);
6165 end = middle;
6167 begin = middle + 1;
6169 end = middle;
6171 begin = middle + 1;
6085 unsigned int begin, middle, end; local
/freebsd-10.0-release/contrib/binutils/libiberty/
H A Dregex.c3966 inserting into the middle of the pattern --
5526 int middle = (lower + upper) / 2;
5527 if (middle == lower || middle == upper)
5529 if (offset_buffer[middle] > length)
5530 upper = middle;
5531 else if (offset_buffer[middle] < length)
5532 lower = middle;
5534 return middle;
5509 int middle = (lower + upper) / 2; local

Completed in 221 milliseconds

12