Home
last modified time | relevance | path

Searched refs:rhs (Results 1 – 25 of 79) sorted by relevance

1234

/titanic_50/usr/src/lib/libfru/libgenutil/
H A DStr.cc51 Str::Str(const Str& rhs) in Str() argument
52 : str_(strcpy(new char[strlen(rhs.str_)+1], rhs.str_)), in Str()
62 Str::operator = (const Str& rhs) in operator =() argument
65 str_ = strcpy(new char[strlen(rhs.str_)+1], rhs.str_); in operator =()
67 nextTok_ = str_ + (rhs.nextTok_ - rhs.str_); in operator =()
79 Str::operator == (const Str& rhs) const in operator ==()
81 return (strcmp(str_, rhs.str_) == 0); in operator ==()
85 Str::operator != (const Str& rhs) const in operator !=()
87 return (strcmp(str_, rhs.str_) != 0); in operator !=()
97 Str::operator<<(Str rhs) in operator <<() argument
[all …]
/titanic_50/usr/src/cmd/fm/eversholt/common/
H A Dout.h82 #define ASSERTeq(lhs, rhs, tostring) \ argument
83 ((void)(((lhs) == (rhs)) || (outfl(O_ABORT, __FILE__, __LINE__, \
85 tostring(lhs), #rhs, tostring(rhs)), 0)))
87 #define ASSERTne(lhs, rhs, tostring) \ argument
88 ((void)(((lhs) != (rhs)) || (outfl(O_ABORT, __FILE__, __LINE__, \
90 tostring(lhs), #rhs, tostring(rhs)), 0)))
96 #define ASSERTeq(lhs, rhs, tostring) ((void)0) argument
97 #define ASSERTne(lhs, rhs, tostring) ((void)0) argument
H A Dcheck.c59 struct node *rhs);
60 static void check_cycle_rhs(struct node *rhs);
132 check_path_iterators(np->u.arrow.rhs); in check_path_iterators()
573 check_propnames(t, np->u.arrow.rhs, from, 1); in check_propnames()
586 ex = record_iterators(np->u.arrow.rhs, ex); in record_iterators()
627 check_exprscope(np->u.arrow.rhs, ex); in check_exprscope()
713 check_upset_engine(struct node *lhs, struct node *rhs, void *arg) in check_upset_engine() argument
719 ASSERTeq(rhs->t, t, ptree_nodetype2str); in check_upset_engine()
721 if ((engnp = tree_s2np_lut_lookup(rhs->u.stmt.lutp, L_engine)) == NULL) in check_upset_engine()
743 check_refcount(struct node *lhs, struct node *rhs, void *arg) in check_refcount() argument
[all …]
H A Dcheck.h52 void check_upset_engine(struct node *lhs, struct node *rhs, void *arg);
53 void check_refcount(struct node *lhs, struct node *rhs, void *arg);
55 void check_cycle(struct node *lhs, struct node *rhs, void *arg);
61 void check_required_props(struct node *lhs, struct node *rhs, void *arg);
H A Dlut.h45 typedef int (*lut_cmp)(void *lhs, void *rhs);
46 struct lut *lut_add(struct lut *root, void *lhs, void *rhs,
50 typedef void (*lut_cb)(void *lhs, void *rhs, void *arg);
H A Deftwrite.c68 ident_lencalc(const char *s, void *rhs, void *arg) in ident_lencalc() argument
75 dict_lencalc(const char *s, void *rhs, void *arg) in dict_lencalc() argument
82 ident_printer(const char *s, void *rhs, void *arg) in ident_printer() argument
91 dict_printer(const char *s, void *rhs, void *arg) in dict_printer() argument
H A Dlut.c78 lut_add(struct lut *root, void *lhs, void *rhs, lut_cmp cmp_func) in lut_add() argument
91 tmp->lut_rhs = rhs; in lut_add()
107 (*tmp_hdl)->lut_rhs = rhs; in lut_add()
/titanic_50/usr/src/cmd/fm/scripts/
H A Ddictck.pl99 my $rhs;
123 $rhs = "";
132 $rhs = $1;
136 $rhs = $1;
138 $rhs =~ s/\\(.)/dobs($1)/ge;
139 $props{$lhs} = $rhs;
140 print "property \"$lhs\" value \"$rhs\"\n" if $opt_v;
177 $rhs = $2;
200 die "$name:$line: duplicate entry for value $rhs\n"
201 if defined($val2keys{$rhs});
[all …]
/titanic_50/usr/src/cmd/logadm/
H A Dlut.c49 static void dooper(const char *lhs, void *rhs, void *arg);
70 lut_add(struct lut *root, const char *lhs, void *rhs) in lut_add() argument
78 root->lut_rhs = rhs; in lut_add()
82 root->lut_rhs = rhs; in lut_add()
84 root->lut_left = lut_add(root->lut_left, lhs, rhs); in lut_add()
86 root->lut_right = lut_add(root->lut_right, lhs, rhs); in lut_add()
92 dooper(const char *lhs, void *rhs, void *arg) in dooper() argument
96 *rootp = lut_add(*rootp, lhs, rhs); in dooper()
138 void (*callback)(const char *lhs, void *rhs, void *arg), void *arg) in lut_walk() argument
155 lut_free(struct lut *root, void (*callback)(void *rhs)) in lut_free() argument
[all …]
H A Dlut.h38 struct lut *lut_add(struct lut *root, const char *lhs, void *rhs);
42 void (*callback)(const char *lhs, void *rhs, void *arg), void *arg);
43 void lut_free(struct lut *root, void (*callback)(void *rhs));
/titanic_50/usr/src/lib/libfru/include/
H A DStr.h45 Str(const Str& rhs);
48 void operator=(const Str& rhs);
51 int operator != (const Str& rhs) const;
52 int operator == (const Str& rhs) const;
55 Str& operator<<(Str rhs);
62 int compare(const Str& rhs) const;
/titanic_50/usr/src/cmd/fm/modules/common/eversholt/
H A Dconfig.c187 addconfigprop(const char *lhs, struct node *rhs, void *arg) in addconfigprop() argument
193 ASSERT(rhs != NULL); in addconfigprop()
194 ASSERT(rhs->t == T_QUOTE); in addconfigprop()
196 config_setprop(cp, lhs, STRDUP(rhs->u.quote.s)); in addconfigprop()
204 addconfig(struct node *lhs, struct node *rhs, void *arg) in addconfig() argument
215 ASSERT(rhs->t == T_CONFIG); in addconfig()
217 lutp = rhs->u.stmt.lutp; in addconfig()
218 rhs = rhs->u.stmt.np; in addconfig()
219 while (rhs != NULL) { in addconfig()
220 ASSERT(rhs->t == T_NAME); in addconfig()
[all …]
H A Deval.c63 begins_with(struct node *lhs, struct node *rhs, struct lut *ex) in begins_with() argument
72 if (rhs == NULL) in begins_with()
76 ASSERTeq(rhs->t, T_NAME, ptree_nodetype2str); in begins_with()
78 if (lhs->u.name.s != rhs->u.name.s) in begins_with()
94 if (rhs->u.name.child && rhs->u.name.child->t == T_NUM) { in begins_with()
95 rnum = (int)rhs->u.name.child->u.ull; in begins_with()
96 } else if (rhs->u.name.child && rhs->u.name.child->t == T_NAME) { in begins_with()
97 iterinfop = lut_lookup(ex, (void *)rhs->u.name.child->u.name.s, in begins_with()
110 return (begins_with(lhs->u.name.next, rhs->u.name.next, ex)); in begins_with()
217 struct node *rhs; in eval_func() local
[all …]
H A Deft.c202 dosubscribe(struct node *lhs, struct node *rhs, void *arg) in dosubscribe() argument
212 dodiscardprint(struct node *lhs, struct node *rhs, void *arg) in dodiscardprint() argument
249 doopendict(const char *lhs, void *rhs, void *arg) in doopendict() argument
/titanic_50/usr/src/lib/libdtrace/common/
H A Ddt_aggregate.c67 dt_aggregate_countcmp(int64_t *lhs, int64_t *rhs) in dt_aggregate_countcmp() argument
70 int64_t rvar = *rhs; in dt_aggregate_countcmp()
98 dt_aggregate_averagecmp(int64_t *lhs, int64_t *rhs) in dt_aggregate_averagecmp() argument
101 int64_t ravg = rhs[0] ? (rhs[1] / rhs[0]) : 0; in dt_aggregate_averagecmp()
113 dt_aggregate_stddevcmp(int64_t *lhs, int64_t *rhs) in dt_aggregate_stddevcmp() argument
116 uint64_t rsd = dt_stddev((uint64_t *)rhs, 1); in dt_aggregate_stddevcmp()
180 dt_aggregate_lquantizedcmp(int64_t *lhs, int64_t *rhs) in dt_aggregate_lquantizedcmp() argument
183 long double rsum = dt_aggregate_lquantizedsum(rhs); in dt_aggregate_lquantizedcmp()
199 rzero = dt_aggregate_lquantizedzero(rhs); in dt_aggregate_lquantizedcmp()
258 dt_aggregate_llquantizedcmp(int64_t *lhs, int64_t *rhs) in dt_aggregate_llquantizedcmp() argument
[all …]
/titanic_50/usr/src/cmd/pgrep/
H A Didtab.c79 idkey_t rhs = *((idkey_t *)rhsp); in idtab_compare() local
81 if (lhs == rhs) in idtab_compare()
84 return (lhs > rhs ? 1 : -1); in idtab_compare()
/titanic_50/usr/src/cmd/man/
H A Dmakewhatis.c374 char *rhs; in trim_rhs() local
376 rhs = &str[strlen(str)]; in trim_rhs()
377 while (--rhs > str && isspace(*rhs)) in trim_rhs()
379 *++rhs = '\0'; in trim_rhs()
380 return (rhs); in trim_rhs()
406 char *rhs; in name_section_line() local
411 rhs = trim_rhs(line); in name_section_line()
414 if (*--rhs == '"') in name_section_line()
415 *rhs = '\0'; in name_section_line()
/titanic_50/usr/src/cmd/mandoc/
H A Dterm.c671 const char *seq, *rhs; in term_strlen() local
696 rhs = NULL; in term_strlen()
709 rhs = mchars_spec2str(p->symtab, in term_strlen()
711 if (rhs != NULL) in term_strlen()
725 rhs = seq + ssz; in term_strlen()
726 while (seq < rhs) { in term_strlen()
746 if (rhs == NULL) { in term_strlen()
748 rhs = ascii_uc2str(uc); in term_strlen()
749 rsz = strlen(rhs); in term_strlen()
770 sz += (*p->width)(p, *rhs++); in term_strlen()
/titanic_50/usr/src/lib/libipmi/common/
H A Dipmi_hash.c143 ipmi_hash_strcmp(const void *lhs, const void *rhs) in ipmi_hash_strcmp() argument
145 return (strcmp(lhs, rhs)); in ipmi_hash_strcmp()
155 ipmi_hash_ptrcmp(const void *lhs, const void *rhs) in ipmi_hash_ptrcmp() argument
157 const uintptr_t *l = lhs, *r = rhs; in ipmi_hash_ptrcmp()
/titanic_50/usr/src/lib/libproc/common/
H A DPstack.c233 uintptr_t rhs = *((const uintptr_t *)rhp); in sort_uclist() local
235 if (lhs < rhs) in sort_uclist()
237 if (lhs > rhs) in sort_uclist()
/titanic_50/usr/src/cmd/mdb/common/mdb/
H A Dmdb_gelf.c305 GElf_Phdr *rhs = (GElf_Phdr *)rp; in gelf_phdr_compare() local
311 if (lhs->p_type == PT_LOAD && rhs->p_type == PT_LOAD) { in gelf_phdr_compare()
312 if (lhs->p_vaddr != rhs->p_vaddr) { in gelf_phdr_compare()
316 if (rhs->p_vaddr == 0) in gelf_phdr_compare()
319 return (lhs->p_vaddr > rhs->p_vaddr ? 1 : -1); in gelf_phdr_compare()
330 if (lhs->p_type != rhs->p_type) { in gelf_phdr_compare()
334 if (rhs->p_type == PT_LOAD) in gelf_phdr_compare()
337 return (lhs->p_type > rhs->p_type ? 1 : -1); in gelf_phdr_compare()
344 if (lhs->p_offset != rhs->p_offset) in gelf_phdr_compare()
345 return (lhs->p_offset > rhs->p_offset ? 1 : -1); in gelf_phdr_compare()
[all …]
H A Dmdb_whatis.c63 uintptr_t rhs = *(const uintptr_t *)r; in uintptr_cmp() local
65 if (lhs < rhs) in uintptr_cmp()
67 if (lhs > rhs) in uintptr_cmp()
337 whatis_cbcmp(const void *lhs, const void *rhs) in whatis_cbcmp() argument
340 whatis_callback_t *r = *(whatis_callback_t * const *)rhs; in whatis_cbcmp()
/titanic_50/usr/src/ucbcmd/sed/
H A Dsed.h112 char *rhs; member
124 char *rhs; member
/titanic_50/usr/src/tools/scripts/
H A Dvalidate_pkg.py177 rhs = other
180 rhs = self
195 typerhs = rhs.name()
205 return (lhs.mediator is None) and (lhs.target != rhs.target)
215 return lhs.mode != rhs.mode
232 return len(lhs.hardpaths.intersection(rhs.hardpaths)) == 0
243 return lhs.path not in rhs.hardpaths
/titanic_50/usr/src/cmd/mdb/common/modules/libc/
H A Dfindstack_subr.c206 const stacks_ulwp_t *rhs = r; in stacks_ulwp_compare() local
208 if (lhs->sulwp_id > rhs->sulwp_id) in stacks_ulwp_compare()
211 if (lhs->sulwp_id < rhs->sulwp_id) in stacks_ulwp_compare()

1234