/ast/src/lib/libpp/ |
H A D | ppcomment.c | 31 ppcomment(char* head, char* comment, char* tail, int line) argument 34 ppprintf("%s%-.*s%s", head, MAXTOKEN - 4, comment, tail);
|
/ast/src/lib/libvcodex/ |
H A D | vcrecode.c | 28 int vcrecode(Vcodex_t* vc, Vcchar_t** dtp, ssize_t* dtz, ssize_t head, int type) argument 30 int vcrecode(vc, dtp, dtz, head, type) 34 ssize_t head; /* extra header */ 44 /* ask follow-on coders to leave head room */ 45 vc->coder->head += vc->head + head; 47 vc->coder->head -= vc->head + head; [all...] |
H A D | vcbuffer.c | 28 Vcchar_t* _vcbuffer(Vcodex_t* vc, Vcchar_t* trunc, ssize_t size, ssize_t head) argument 30 Vcchar_t* _vcbuffer(vc, trunc, size, head) 34 ssize_t head; /* head room in front of buffer */ 77 size += (head = trunc - (Vcchar_t*)b->buf); 95 return (Vcchar_t*)(&b->buf[head]); 123 { head = (head <= 0 ? 0 : head) + vc->head; /* require [all...] |
/ast/src/lib/libcodex/ |
H A D | codexid.c | 32 codexid(const void* head, size_t headsize, char* name, size_t namesize) argument 37 if (meth->identf && (*meth->identf)(meth, head, headsize, name, namesize))
|
/ast/src/cmd/cs/vcs_src/ |
H A D | vcs_dir.c | 28 static rdirent_t* add_entry(head, tp) 29 rdirent_t* head; 48 dp = head; 49 prev_posn = &head; 70 return (head); 77 return (head); 90 return (head); 103 return (head); 113 rdirent_t* head; local 121 head [all...] |
/ast/src/lib/libast/sfio/ |
H A D | sfpool.c | 97 /* move a stream to head */ 107 reg Sfio_t* head; local 116 head = p->sf[0]; 117 if(SFFROZEN(head) ) 120 SFLOCK(head,0); 123 if(!(p->mode&SF_SHARE) || (head->mode&SF_READ) || (f->mode&SF_READ) ) 124 { if(SFSYNC(head) < 0) 128 { if(SFMODE(head,1) != SF_WRITE && _sfmode(head,SF_WRITE,1) < 0) 132 v = head [all...] |
/ast/src/lib/librecsort/ |
H A D | rs-copy.c | 31 Rsobj_t* head; member in struct:Copy_s 48 copy->head = obj; 67 return copy->head;
|
H A D | rswrite.c | 83 ssize_t w, head, n; local 115 head = (rs->type&RS_DSAMELEN) ? -1 : (rs->disc->data & ~0xff) ? 0 : sizeof(ssize_t); 117 head = (rs->type&RS_DSAMELEN) ? -1 : sizeof(ssize_t); 148 { if(head>=0) 170 { if(head>=0) 241 w = (n = r->datalen) + (head>0?head:0); 243 if(head>0) 248 else if(head>=0) 250 { w = (n = r->datalen) + head; [all...] |
/ast/src/cmd/std/ |
H A D | tsort.c | 98 Node_t* head = 0; local 118 if (head) 120 if (head != x) 124 p->node = head; 128 head = 0; 131 head = x; 136 if (head)
|
/ast/src/cmd/mailx/port/ |
H A D | dtstkq.c | 72 ** dtsearch() moves an element to head of list. 73 ** dtdelete() always deletes from head of list. 74 ** List is doubly linked with head->left points to last elt. 92 { /* always happens at head of list */ 93 t = dt->data->head; 96 dt->data->head = t->right; 97 if(t->right) /* head->left always points to last element */ 111 { if(!(r = dt->data->head) || !(type&(DT_CLEAR|DT_FIRST|DT_LAST)) ) 123 dt->data->head = dt->data->here = NIL(Dtlink_t*); 150 if(!(r = dt->data->head) ) [all...] |
H A D | dtlist.c | 91 { if(!(r = dt->data->head) || !(type&(DT_CLEAR|DT_FIRST|DT_LAST)) ) 103 dt->data->head = dt->data->here = NIL(Dtlink_t*); 129 { for(t = dt->data->head; t; prev = t->left, t = prev->right) 143 if(!prev && (r = dt->data->head->left) != t->left) 152 t->left->right = dt->data->head; 153 dt->data->head = t; 155 else t = dt->data->head; 162 { dt->data->head = t->right; 178 { if(!prev && t != dt->data->head) 179 prev = dt->data->head; [all...] |
H A D | dtrenew.c | 120 for(t = dt->data->head->left; t != e->left; r = t, t = t->right->left) 123 if(e == (t = r ? r->right : dt->data->head) ) 126 else dt->data->head = e->right; 135 { r = r ? r->right : dt->data->head;
|
H A D | dtextract.c | 103 { list = dt->data->head; 104 dt->data->head = NIL(Dtlink_t*);
|
/ast/src/lib/libvcodex/Vchuff/ |
H A D | vchsize.c | 71 Vchtree_t *f, *s, *p, *list, *tail, *head; local 118 for(head = tail = NIL(Vchtree_t*), list = sort[0];; ) 120 ** 0. The lists "list" and "head" are sorted by frequency. 122 ** 2. head == NULL or head->freq >= list->next->freq 140 tail = head ? (tail->next = f) : (head = f); 144 { if(list->next && list->next->freq <= head->freq) 147 /* find the segment in "head" movable to start of list */ 148 for(p = NIL(Vchtree_t*), f = head; [all...] |
/ast/src/cmd/mailx/ |
H A D | main.c | 235 struct header head; local 251 memset(&head, 0, sizeof(head)); 327 extract(&head, GBCC|GMETOO, optarg); 333 extract(&head, GCC|GMETOO, optarg); 410 if (head.h_subject = optarg) 411 head.h_flags |= GSUB; 455 extract(&head, GTO|GMETOO, argv[i]); 457 head.h_options = argv; 459 state.mode = (head [all...] |
/ast/src/lib/libvgraph/ |
H A D | graph.c | 45 else if(e1->head != e2->head) 46 return e1->head < e2->head ? -1 : 1; 88 gredge(gr, e->tail, e->head, e->label, -1); 92 gredge(gr, e->tail, e->head, e->label, -1); 118 Gredge_t* gredge(Graph_t* gr, Grnode_t* tail, Grnode_t* head, Void_t* label, int type) argument 124 if(gr->type == GR_UNDIRECTED) /* enforce tail <= head */ 125 if(tail > head) 126 { nd = tail; tail = head; hea [all...] |
H A D | grbranching.c | 50 PRINT(Fd,"%d", (int)ed->head->label); PRINT(Fd,"(%d), ", (int)grfind(ed->head)->label ); 159 if(grfind(ec->head) == nc) /* end of cycle */ 178 { BREDGE(ec)->root = grfind(ec->head); /* save node union structure */ 181 for(ep = NIL(Gredge_t*), e = grfind(ec->head)->iedge; e; e = e->inext) 186 ep->inext = en; en = grfind(ec->head)->iedge; /* catenate lists */ 187 grfind(ec->head)->iedge = NIL(Gredge_t*); 192 { if(grfind(ec->head) == nc) 194 grfind(ec->head)->link = nc; /* union history kept as-is */ 195 grfind(ec->head) [all...] |
/ast/src/cmd/pax/ |
H A D | pax-rpm.c | 80 Rpm_head_t head; local 195 if (paxread(pax, ap, &head, (off_t)sizeof(head), (off_t)sizeof(head), 0) <= 0) 201 swapmem(swap, &head, &head, sizeof(head)); 202 num = head.entries * sizeof(Rpm_entry_t) + head.datalen; 203 message((-2, "%s: head entrie [all...] |
/ast/src/cmd/html/ |
H A D | bb2tok.c | 85 token(State_t* state, Sfio_t* op, const char* text, const Header_t* head, int push) argument 87 if (!head) 105 if (head->lex == LINK && state->prev->lex == NAME && state->push) 107 if (head->lex == LINE && state->prev->lex == HEADER && !state->push) 109 if (head->lex == HEADER && push && state->prev->lex == HEADER && !state->push) 114 if (state->keep && (state->prev->lex != head->lex || !head->unary && state->push)) 116 if (head->lex == LINE && state->prev->lex == BODY && !state->push) 119 switch (head->lex) 123 sfprintf(op, "<%s>", head [all...] |
/ast/src/lib/libast/path/ |
H A D | pathfind.c | 45 Dir_t* head; /* directory list head */ member in struct:__anon299 61 for (dp = state.head; dp; dp = dp->next) 71 state.head = state.tail = dp; 136 for (dp = state.head; dp; dp = dp->next)
|
/ast/src/cmd/3d/ |
H A D | vcs.c | 214 add_entry(Rdirent_t* head, Tag_t* tp) argument 228 dp = head; 229 prev_posn = &head; 259 return(head); 266 return(head); 279 return(head); 292 return(head); 318 Rdirent_t* head; local 326 head = 0; 329 head [all...] |
/ast/src/lib/libz/ |
H A D | inflate.c | 117 state->head = Z_NULL; 604 if (state->head != Z_NULL) 605 state->head->done = -1; 647 if (state->head != Z_NULL) 648 state->head->text = (int)((hold >> 8) & 1); 654 if (state->head != Z_NULL) 655 state->head->time = hold; 661 if (state->head != Z_NULL) { 662 state->head->xflags = (int)(hold & 0xff); 663 state->head [all...] |
/ast/src/lib/libast/vmalloc/ |
H A D | vmhdr.h | 219 Head_t* head; member in union:_align_u 237 /* make sure that the head of a block is a multiple of ALIGN */ 254 struct _head_s head; member in union:_head_u 278 { Head_t head; member in struct:_block_s 290 #define TLEFT(b) ((b)->head.head.seg.link) /* instead of LEFT */ 343 #define SEG(b) ((b)->head.head.seg.seg) 344 #define SEGLINK(b) ((b)->head.head [all...] |
/ast/src/lib/libdss/ |
H A D | dssopt.c | 220 int head; local 287 head = 0; 294 if ((head = !!strchr(s, ' ')) && meth->description && optout(sp, meth->name, NiL, NiL, NiL, meth->description, NiL)) 304 if (!head) 311 if (head) 312 head = 0; 318 if (!head) 322 head = 1; 327 head = 0; 331 if (!head) [all...] |
/ast/src/cmd/INIT/ |
H A D | hurl.sh | 130 do if ! read head data 134 test 0 != $verbose && echo "$command: head=$head $data" >&2 135 case $head in
|