Home
last modified time | relevance | path

Searched refs:op (Results 1 – 25 of 307) sorted by relevance

12345678910>>...13

/original-bsd/usr.bin/ex/
H A Dex_set.c73 for (op = options; op < &options[NOPTS]; op++) in set()
74 if (eq(op->oname, cp) || op->oabbrev && eq(op->oabbrev, cp)) in set()
76 if (op->oname == 0) in set()
82 propt(op); in set()
172 propt(op); in prall()
174 propt(&op[incr]); in prall()
187 for (op = options; op < &options[NOPTS]; op++) { in propts()
198 if (op->ovalue == op->odefault) in propts()
207 propt(op); in propts()
214 propt(op) in propt() argument
[all …]
/original-bsd/lib/libc/stdlib/
H A Dmalloc.c119 n = n - sizeof (*op) - ((int)op & (n - 1));
169 op->ov_magic = MAGIC;
181 *(u_short *)((caddr_t)(op + 1) + op->ov_size) = RMAGIC;
218 if ((int)op == -1)
226 op->ov_next = (union overhead *)((caddr_t)op + sz);
227 op = (union overhead *)((caddr_t)op + sz);
249 ASSERT(*(u_short *)((caddr_t)(op + 1) + op->ov_size) == RMAGIC);
254 nextf[size] = op;
280 union overhead *op; local
289 i = op->ov_index;
[all …]
/original-bsd/games/arithmetic/
H A Darithmetic.c161 if (op != '/') in problem()
165 switch (op) { in problem()
218 penalise(right, op, 1); in problem()
219 if (op == 'x' || op == '+') in problem()
220 penalise(left, op, 0); in problem()
265 int value, op, operand; in penalise()
270 op = opnum(op);
291 op = opnum(op);
330 opnum(op) in opnum() argument
331 int op; in opnum()
[all …]
/original-bsd/games/monop/
H A Dmisc.c95 op = play[pl].own_list;
99 while (op) {
103 switch (op->sqr->type) {
108 for (num = 0; op && op->sqr->type == UTIL; op = op->next)
119 for (num = 0; op && op->sqr->type == RR; op = op->next) {
122 printf("op = %d, op->sqr = %d, op->sqr->type = %d\n", op, op->sqr, op->sqr->type);
136 orig_op = op;
138 while (op && op->sqr->desc->mon_desc == orig) {
146 op = op->next;
148 printf("[%d];\n", op);
[all …]
H A Dprop.c39 OWN *op; local
47 cfree(op);
52 op->next = tp;
56 *head = op;
83 for (op = *head; op; op = op->next)
87 last_op = op;
89 *head = op->next;
92 cfree(op);
174 reg OWN *op; local
178 for (op = plp->own_list; op; op = op->next) {
[all …]
H A Dmorg.c77 reg OWN *op; in set_mlist() local
80 for (op = cur_p->own_list; op; op = op->next) in set_mlist()
81 if (!op->sqr->desc->morg) in set_mlist()
82 if (op->sqr->type == PRPTY && op->sqr->desc->houses) in set_mlist()
85 names[num_good] = op->sqr->name; in set_mlist()
86 square[num_good++] = sqnum(op->sqr); in set_mlist()
136 reg OWN *op; in set_umlist() local
139 for (op = cur_p->own_list; op; op = op->next) in set_umlist()
140 if (op->sqr->desc->morg) { in set_umlist()
141 names[num_good] = op->sqr->name; in set_umlist()
[all …]
H A Dtrade.c73 OWN *op; local
95 for (op = pp->own_list; prop--; op = op->next)
122 reg OWN *op; local
125 for (op = the_list; op; op = op->next)
140 OWN *op; in summate() local
153 for (op = tp->prop_list; op; op = op->next) in summate()
176 reg OWN *op; local
185 for (op = from->prop_list; op; op = op->next) {
198 reg OWN *op; in resign() local
250 for (op = cur_p->own_list; op; op = op->next) { in resign()
[all …]
H A Dhouses.c26 reg OWN *op; in buy_houses() local
34 for (op = cur_p->own_list; op && op->sqr->type != PRPTY; op = op->next) in buy_houses()
36 while (op) in buy_houses()
43 if (op->sqr->desc->morg) in buy_houses()
47 op = op->next; in buy_houses()
53 op = op->next; in buy_houses()
136 reg OWN *op; in sell_houses() local
143 for (op = cur_p->own_list; op; op = op->next) in sell_houses()
144 if (op->sqr->type == PRPTY && op->sqr->desc->monop) { in sell_houses()
152 while (op->next && op->sqr->desc->mon_desc == mp in sell_houses()
[all …]
/original-bsd/games/hack/
H A Dhack.options.c34 *op++ = 0;
38 op2 = op;
39 while(*op++)
40 if(*op != ' ') *op2++ = *op;
105 if(!op) goto bad;
114 op++;
115 while(*op) {
119 while(digit(*op)) op++;
123 op++;
125 switch(*op) {
[all …]
/original-bsd/usr.bin/pascal/src/
H A Dtmps.c124 putlbracket(ftnno, op);
136 op->low_water[REG_DATA] = offset;
140 putlbracket(ftnno, op);
150 op->low_water[REG_ADDR] = offset;
154 putlbracket(ftnno, op);
166 op->curtmps.om_off =
168 offset = op->curtmps.om_off;
169 if ( offset < op->om_max ) {
170 op->om_max = offset;
175 putlbracket(ftnno, op);
[all …]
H A Dfunc.c36 register op; local
78 switch (op) {
91 (void) put(1, op);
121 if (op == O_EOF || op == O_EOLN)
127 switch (op) {
147 (void) put(1, op);
148 if (op == O_UNDEF)
159 (void) put(1, op);
167 (void) put(1, op);
211 op++;
[all …]
/original-bsd/old/pcc/c2.tahoe/
H A Dc21.c19 && (p->op==ADD || p->op==MUL || p->op==AND || p->op==OR || p->op==XOR)) {
382 if (pb->op!=CVT && pb->op!=MOVZ && pb->op!=SHAR && pb->op!=SHR) in bmove()
598 ((p->op==CVT || p->op==MOVZ || p->op==CVFL) &&
604 if (p->op==INC || p->op==DEC) {
701 if (q->op!=CBR && q->op!=ADDA && q->op!=SUBA) {
763 if (p->op==MOV || p->op==PUSH || p->op==CVT ||
764 p->op==MOVZ || p->op==COM || p->op==NEG ||
915 p->op = q->op;
919 p->op = q->op;
955 if(p->op ==STF || p->op==TSTF || p->op==PUSHD) {
[all …]
H A Dc20.c168 p->op = op->opcod; p->subop = op->subopcod; in input()
185 p->op = op->opcod; p->subop = op->subopcod; in input()
197 p->op = op->opcod; p->subop = op->subopcod; in input()
229 p->op = op->opcod; p->subop = op->subopcod; in input()
478 if (p->op==JBR && p->subop==0 || p->op==CBR || p->op==JSW || p->op==JMP in refcount()
512 if ((p->op==JBR||p->op==CBR||p->op==JSW) && p->ref) { in iterate()
548 if (p->op==JBR || p->op==JMP) { in iterate()
608 if (op->op == LABEL) {
612 if (op->back->op == LABEL) {
613 op = op->back;
[all …]
/original-bsd/sys/scripts/
H A Dstats6 set $op=(struct sdop *)&($arg0[$arg2])
10 …printf "%d %d 0x%x 0x%x %d", $op->bp, $op->bufsize, $op->blkno, $op->when.tv_sec, $op->when.tv_usec
11 if ($op->op & 1)
16 set $op = $op + 1
/original-bsd/local/ditroff/ditroff.okeeffe/devnver/Sort/
H A Dnvsort.c259 op += strlen(op);
278 op += strlen(op);
308 op += strlen(op);
334 op += strlen(op);
342 op += strlen(op);
360 op += strlen(op);
523 op += strlen(op);
535 op += strlen(op);
545 op += strlen(op);
564 op += strlen(op);
[all …]
/original-bsd/local/ditroff/ditroff.okeeffe/devver/
H A Dvsort.c259 op += strlen(op);
278 op += strlen(op);
308 op += strlen(op);
334 op += strlen(op);
342 op += strlen(op);
360 op += strlen(op);
523 op += strlen(op);
535 op += strlen(op);
545 op += strlen(op);
567 op += strlen(op);
[all …]
/original-bsd/sys/sparc/sparc/
H A Dopenprom.c111 node = op->op_nodeid;
132 error = openpromgetstr(op->op_namelen, op->op_name, &name);
138 if (len > op->op_buflen)
139 len = op->op_buflen;
141 op->op_buflen = len;
157 error = openpromgetstr(op->op_namelen, op->op_name, &name);
160 error = openpromgetstr(op->op_buflen, op->op_buf, &value);
175 error = openpromgetstr(op->op_namelen, op->op_name, &name);
182 if (len > op->op_buflen)
183 len = op->op_buflen;
[all …]
/original-bsd/local/ditroff/ditroff.old.okeeffe/driver/
H A Dvsort.c241 op += strlen(op);
266 op += strlen(op);
276 op += strlen(op);
284 op += strlen(op);
295 op += strlen(op);
363 op += strlen(op);
379 op += strlen(op);
852 op += strlen(op);
857 op += strlen(op);
937 op += strlen(op);
[all …]
/original-bsd/old/pcc/ccom.tahoe/
H A Dorder.c19 return( p->in.op == REG || p->in.op == NAME || p->in.op == OREG );
31 o = p->in.op;
38 else if( p->in.left->in.op == FLD && p->in.left->in.left->in.op == UNARY MUL ){
75 o = p->in.op;
262 if( p->in.op == PLUS || p->in.op == MINUS ){
325 if( p->in.op != NAME && p->in.op != OREG ){
381 switch( p->in.op ){
423 p->in.op = FREE;
432 p->in.op = FREE;
450 pasg->in.op = STASG;
[all …]
H A Dlocal2.c264 s->in.op = FREE;
401 if(p->in.op == LS || p->in.op == ASG LS)
1129 printf("\nshumul:op=%d,lop=%d,rop=%d", p->in.op, p->in.left->in.op, p->in.right->in.op);
1133 o = p->in.op;
1336 if( p->in.op == STCALL || p->in.op == UNARY STCALL ){
1498 if( (l->in.op == CALL || l->in.op == UNARY CALL) &&
1787 o = p->in.op;
1838 q->in.op = NOASG p->in.op;
1879 q->in.op = CM;
1907 o = p->in.op;
[all …]
/original-bsd/old/pcc/ccom.vax/
H A Dorder.c19 return( p->in.op == REG || p->in.op == NAME || p->in.op == OREG );
26 if( q->in.op != INCR ||
46 o = p->in.op;
53 else if( p->in.left->in.op == FLD && p->in.left->in.left->in.op == UNARY MUL ){
92 o = p->in.op;
307 if( p->in.op == PLUS || p->in.op == MINUS ){
372 if( p->in.op != NAME && p->in.op != OREG ){
431 switch( p->in.op ){
473 p->in.op = FREE;
482 p->in.op = FREE;
[all …]
/original-bsd/bin/test/
H A Dtest.c176 opsp->op = op;
247 else if (opsp->op == AND1 || opsp->op == OR1)
256 if (op == AND1 || op == AND2) {
257 op = AND1;
261 if (op == OR1 || op == OR2) {
262 op = OR1;
267 opsp->op = op;
299 int op; in expr_operator()
305 switch (op) {
449 int op, c; local
[all …]
/original-bsd/old/dbx/
H A Dcheck.c46 switch (p->op) {
151 } else if (exp->op == O_LCON or exp->op == O_QLINE) {
155 if (p->op == O_TRACE) {
160 } else if (place != nil and (place->op == O_QLINE or place->op == O_LCON)) {
161 if (p->op == O_TRACE) {
167 if (exp->op != O_RVAL and exp->op != O_SYM and exp->op != O_CALL) {
187 if (exp->op != O_RVAL and exp->op != O_SYM and exp->op != O_LCON) {
195 if (place->op == O_SYM) {
218 if (b->op != O_SYM) {
258 } else if (p->op != O_QLINE and p->op != O_LCON) {
[all …]
/original-bsd/lib/libc/gen/
H A Dsetmode.c145 register char op; local
217 getop: if ((op = *p++) != '+' && op != '-' && op != '=') {
221 if (op == '=')
263 if (op == '=')
314 register int op;
317 switch (op) {
323 op = '+';
328 set->cmd = op;
335 set->cmd = op;
388 while ((op = nset->cmd) != '+' && op != '-' && op != 'X') {
[all …]
/original-bsd/usr.bin/tcopy/
H A Dtcopy.c63 op = COPYVERIFY;
74 op = VERIFY;
88 if (op != READ)
93 if (op != READ)
98 if (op == READ)
99 op = COPY;
115 if (op == VERIFY) {
151 if (op == COPY || op == COPYVERIFY) {
193 if (op == COPY || op == COPYVERIFY) {
291 struct mtop op; local
[all …]

12345678910>>...13