/macosx-10.10/ncurses-44/ncurses/ncurses/base/ |
H A D | MKunctrl.awk | 60 gap = "," 69 printf "%4d%s", offset, gap; 86 gap = gap " " 91 gap = "\n" 93 gap = gap " " 97 printf "\"%s\"%s", part, gap 112 gap = "," 120 printf "%4d%s", offset, gap; [all...] |
H A D | lib_slk.c | 126 int gap = (cols - 3 * (3 + 4 * max_length)) / 2; local 128 if (gap < 1) 129 gap = 1; 134 x += (i == 3 || i == 7) ? gap : 1; 138 int gap = cols - (SP->_slk->maxlab * max_length) - 6; local 140 if (gap < 1) 141 gap = 1; 145 x += (i == 3) ? gap : 1; 149 int gap = (cols - (SP->_slk->maxlab * max_length) - 5) local 152 if (gap < [all...] |
/macosx-10.10/WebCore-7600.1.25/rendering/ |
H A D | Pagination.h | 38 , gap(0) 44 return mode == other.mode && behavesLikeColumns == other.behavesLikeColumns && pageLength == other.pageLength && gap == other.gap; 49 return mode != other.mode || behavesLikeColumns != other.behavesLikeColumns || pageLength != other.pageLength || gap != other.gap; 55 unsigned gap; member in struct:WebCore::Pagination
|
/macosx-10.10/cxxfilt-11/cxxfilt/bfd/ |
H A D | coff-w65.c | 126 bfd_vma gap; local 173 gap = value - dot; 175 if (-120 < (long) gap && (long) gap < 120) 195 gap = value - (dot - shrink); 197 if (-120 < (long) gap && (long) gap < 120) 243 unsigned int gap = bfd_coff_reloc16_get_value (reloc, link_info, local 245 bfd_put_8 (abfd, gap, data + dst_address); 253 unsigned int gap local 264 unsigned int gap = bfd_coff_reloc16_get_value (reloc, link_info, local 275 unsigned int gap = bfd_coff_reloc16_get_value (reloc, link_info, local 285 unsigned int gap = bfd_coff_reloc16_get_value (reloc, link_info, local 295 unsigned int gap = bfd_coff_reloc16_get_value (reloc, link_info, local 306 unsigned int gap = bfd_coff_reloc16_get_value (reloc, link_info, local 317 int gap = bfd_coff_reloc16_get_value (reloc, link_info, local 341 bfd_vma gap = bfd_coff_reloc16_get_value (reloc, link_info, local [all...] |
H A D | coff-z8k.c | 236 int gap = dst - dot - 1; /* -1, since we're in the odd byte of the local 239 if (gap & 1) 241 gap /= 2; 242 if (gap > 128 || gap < -128) 251 bfd_put_8 (in_abfd, gap, data + *dst_ptr); 264 int gap = dst - dot - 1; /* -1, since we're in the odd byte of the local 267 if (gap & 1) 269 gap /= 2; 271 if (gap > 295 int gap = dst - dot - 2; local 324 int gap = dst - dot - 2; local [all...] |
H A D | coff-h8500.c | 252 int gap = dst - dot - 1; /* -1 since were in the odd byte of the 255 if (gap > 128 || gap < -128) 264 bfd_put_8 (in_abfd, gap, data + *dst_ptr); 276 int gap = dst - dot - 1; /* -1 since were in the odd byte of the 279 if (gap > 32767 || gap < -32768) 288 bfd_put_16 (in_abfd, (bfd_vma) gap, data + *dst_ptr); 251 int gap = dst - dot - 1; /* -1 since were in the odd byte of the local 275 int gap = dst - dot - 1; /* -1 since were in the odd byte of the local
|
H A D | coff-h8300.c | 221 which means that the gap after the instruction may not be enough to 436 bfd_vma gap; local 467 gap = value - dot; 472 if ((int) gap >= -128 && (int) gap <= 128) 510 && gap <= 126 553 gap = value - dot; 558 if ((int) gap >= -128 && (int) gap <= 128) 659 int gap, tm local [all...] |
H A D | coff-z80.c | 225 int gap = dst - dot - 1; /* -1, Since the offset is relative local 229 if (gap >= 128 || gap < -128) 238 bfd_put_8 (in_abfd, gap, data + *dst_ptr);
|
/macosx-10.10/BerkeleyDB-21/db/common/ |
H A D | db_idspace.c | 38 * available (by finding the biggest gap). The minimum can be an inuse 50 u_int32_t gap, t; local 66 gap = 0; 70 if ((t = (inuse[i + 1] - inuse[i])) > gap) { 71 gap = t; 75 /* Check for largest gap at the end of the space. */ 76 if ((*maxp - inuse[n - 1]) + (inuse[0] - *minp) > gap) {
|
/macosx-10.10/hfs-285/CopyHFSMeta/ |
H A D | dump.c | 26 size_t gap = (cp + WIDTH) - tend; local 28 if (gap != 0 || tend == end) 56 for (i = gap; i >= 0; i--) { 65 for (i = 0; i < gap; i++) {
|
/macosx-10.10/vim-55/src/ |
H A D | fold.c | 47 static int checkCloseRec __ARGS((garray_T *gap, linenr_T lnum, int level)); 48 static int foldFind __ARGS((garray_T *gap, linenr_T lnum, fold_T **fpp)); 55 static void deleteFoldEntry __ARGS((garray_T *gap, int idx, int recursive)); 56 static void foldMarkAdjustRecurse __ARGS((garray_T *gap, linenr_T line1, linenr_T line2, long amount, long amount_after)); 57 static int getDeepestNestingRecurse __ARGS((garray_T *gap)); 60 static void setSmallMaybe __ARGS((garray_T *gap)); 161 garray_T *gap; local 195 gap = &win->w_folds; 198 if (!foldFind(gap, lnum_rel, &fp)) 220 gap 610 garray_T *gap; local 738 garray_T *gap; local 911 garray_T *gap; local 1211 garray_T *gap; local 1333 garray_T *gap; local 2267 garray_T *gap = &wp->w_folds; local [all...] |
H A D | ex_cmds2.c | 415 #define DEBUGGY(gap, idx) (((struct debuggy *)gap->ga_data)[idx]) 425 static int dbg_parsearg __ARGS((char_u *arg, garray_T *gap)); 426 static linenr_T debuggy_find __ARGS((int file,char_u *fname, linenr_T after, garray_T *gap, int *fp)); 435 dbg_parsearg(arg, gap) 437 garray_T *gap; /* either &dbg_breakp or &prof_ga */ 444 if (ga_grow(gap, 1) == FAIL) 446 bp = &DEBUGGY(gap, gap->ga_len); 455 gap ! 545 garray_T *gap; local 608 garray_T *gap; local 2065 garray_T *gap = &curwin->w_alist->al_ga; local [all...] |
H A D | misc1.c | 1983 * cells. May result in adding spaces to fill a gap. 8699 static int expand_backtick __ARGS((garray_T *gap, char_u *pat, int flags)); 8744 * directories. Adds matches to "gap". Handles "*", "?", "[a-z]", "**", etc. 8753 garray_T *gap, 8762 int start_len = gap->ga_len; 8879 (void)dos_expandpath(gap, buf, (int)(s - buf), flags, TRUE); 8947 (void)dos_expandpath(gap, buf, len + 1, flags, TRUE); 8956 (void)dos_expandpath(gap, buf, len + 1, flags, FALSE); 8965 addfile(gap, buf, flags); 8985 if (!ok && matchname != NULL && gap 8752 dos_expandpath( garray_T *gap, char_u *path, int wildoff, int flags, int didstar) argument 9029 mch_expandpath( garray_T *gap, char_u *path, int flags) argument [all...] |
H A D | os_riscos.c | 847 mch_expandpath(gap, path, flags) 848 garray_T *gap; /* Grow array for results. */ 861 * If (3) is nothing then only the leaf is wildcarded - add to gap 871 got = expand_section(gap, (char_u *)"", pattern, flags); 877 * expand_section(gap, "$.Dir1.Dir2", "ABBA*.myleaf##") 879 * calls expand_section(gap, "$.Dir1.Dir2.ABBA_Gold", "myleaf##") 880 * and expand_section(gap, "$.Dir1.Dir2.ABBA_Live", "myleaf##") 882 * If rest is just a leaf then all matches are added to gap. 884 * Returns number of items added to gap. 887 expand_section(gap, roo [all...] |
/macosx-10.10/WebCore-7600.1.25/style/ |
H A D | InlineTextBoxStyle.cpp | 37 // This represents the gap between the baseline and the closest edge of the underline. 38 int gap = std::max<int>(1, ceilf(textDecorationThickness / 2.0)); local 45 return fontMetrics.ascent() + gap; 50 return inlineTextBox->logicalHeight() + gap + std::max<float>(offset, 0); 55 return fontMetrics.ascent() + gap;
|
/macosx-10.10/vim-55/src/proto/ |
H A D | os_vms.pro | 11 int mch_expandpath __ARGS((garray_T *gap, char_u *path, int flags));
|
H A D | misc2.pro | 51 void ga_clear __ARGS((garray_T *gap)); 52 void ga_clear_strings __ARGS((garray_T *gap)); 53 void ga_init __ARGS((garray_T *gap)); 54 void ga_init2 __ARGS((garray_T *gap, int itemsize, int growsize)); 55 int ga_grow __ARGS((garray_T *gap, int n)); 56 char_u *ga_concat_strings __ARGS((garray_T *gap)); 57 void ga_concat __ARGS((garray_T *gap, char_u *s)); 58 void ga_append __ARGS((garray_T *gap, int c));
|
H A D | os_riscos.pro | 37 int mch_expandpath __ARGS((garray_T *gap, char_u *path, int flags)); 38 int expand_section __ARGS((garray_T *gap, char_u *root, char_u *rest, int flags));
|
H A D | spell.pro | 16 void spell_suggest_list __ARGS((garray_T *gap, char_u *word, int maxcount, int need_cap, int interactive));
|
/macosx-10.10/emacs-93/emacs/lisp/net/ |
H A D | eudc-hotlist.el | 68 gap) 77 (setq gap (make-string (- proto-col 6) ?\ )) 81 "Server" gap "Protocol\n" 82 "------" gap "--------\n"
|
/macosx-10.10/less-25/less/ |
H A D | linenum.c | 47 POSITION gap; /* Gap between prev and next */ member in struct:linenum_info 51 * "gap" needs some explanation: the gap of any particular line number 54 * gap of a line number is the gap which would be introduced if this 97 anchor.gap = 0; 103 * Calculate the gap for an entry. 110 * Don't bother to compute a gap for the anchor. 111 * Also don't compute a gap for the last one in the list. 112 * The gap fo [all...] |
/macosx-10.10/ksh-23/ksh/src/lib/libast/uwin/ |
H A D | support.c | 85 static const short prep1=57, gap=7, bias=129 ; variable 89 static const short prep1=54, gap=4, bias=1023 ; variable 122 if((k = (k>>gap)+ N) > 0 ) 123 if( k < (mexp>>gap) ) *px = (*px&~mexp) | (k<<gap); 128 {*px=(*px&~mexp)|(short)(1<<gap); x *= scalb(1.0,k-1);} 193 return (int)(((*px&mexp)>>gap)-bias); 197 return ( (k>>gap) - bias ); 287 else if ( ((*pp & mexp)>>gap) <= 1 )
|
/macosx-10.10/network_cmds-457/ping6.tproj/ |
H A D | md5.c | 149 u_int gap, i; local 152 gap = MD5_BUFLEN - ctxt->md5_i; 154 if (len >= gap) { 156 gap); 159 for (i = gap; i + MD5_BUFLEN <= len; i += MD5_BUFLEN) { 175 u_int gap; local 178 gap = MD5_BUFLEN - ctxt->md5_i; 179 if (gap > 8) { 182 gap - sizeof(ctxt->md5_n)); 184 /* including gap [all...] |
/macosx-10.10/text_cmds-88/pr/ |
H A D | pr.c | 98 int ingap; /* expand input gap */ 104 int ogap; /* contract output gap */ 1010 int gap = ingap; local 1017 if (gap) { 1030 col = gap - (col % gap); 1122 int gap = ogap; local 1147 ips += gap - (ips % gap); 1159 if ((tbps = ops + gap [all...] |
/macosx-10.10/WebKit2-7600.1.25/WebProcess/WebPage/mac/ |
H A D | ServicesOverlayController.mm | 252 static void expandForGap(Vector<LayoutRect>& rects, uint8_t* alignments, const GapRects& gap) 254 if (!gap.left().isEmpty()) { 255 LayoutUnit leftEdge = gap.left().x(); 262 if (!gap.right().isEmpty()) { 263 LayoutUnit rightEdge = gap.right().maxX(); 345 // Account for each GapRects by extending the edge of certain LayoutRects to meet the gap. 346 for (auto& gap : gapRects) 347 expandForGap(rects, alignments, gap); 369 GapRects gap; 370 gap [all...] |