HomeSort by: relevance | last modified time | path
    Searched refs:cg (Results 1 - 25 of 94) sorted by relevancy

1 2 3 4

  /src/external/gpl3/binutils/dist/gprof/
cg_arcs.c 71 for (arc = parent->cg.children; arc; arc = arc->next_child)
135 arc->next_child = parent->cg.children;
136 parent->cg.children = arc;
139 arc->next_parent = child->cg.parents;
140 child->cg.parents = arc;
150 return left->cg.top_order - right->cg.top_order;
161 if (parent->cg.prop.fract == 0.0)
168 for (arc = parent->cg.children; arc; arc = arc->next_child)
171 if (arc->count == 0 || child == parent || child->cg.prop.fract == 0
    [all...]
cg_dfn.c 65 return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;
75 if (child->cg.top_order == DFN_NAN)
104 if (child->cg.cyc.head != child && child->cg.cyc.head == head)
152 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next)
165 if (head->cg.cyc.head != head)
167 head = head->cg.cyc.head;
175 if (child->cg.cyc.head == child
    [all...]
utils.c 91 DBG (DFNDEBUG, printf ("{%d} ", self->cg.top_order));
92 DBG (PROPDEBUG, printf ("%4.0f%% ", 100.0 * self->cg.prop.fract));
103 if (self->cg.cyc.num != 0)
105 printf (_(" <cycle %d>"), self->cg.cyc.num);
107 if (self->cg.index != 0)
109 if (self->cg.print_flag)
111 printf (" [%d]", self->cg.index);
115 printf (" (%d)", self->cg.index);
cg_print.c 120 sprintf (buf, "[%d]", cyc->cg.index);
124 100 * (cyc->cg.prop.self + cyc->cg.prop.child) / print_time,
125 cyc->cg.prop.self / hz, cyc->cg.prop.child / hz, cyc->ncalls);
127 if (cyc->cg.self_calls != 0)
128 printf ("+%-7lu", cyc->cg.self_calls);
132 printf (_(" <cycle %d as a whole> [%d]\n"), cyc->cg.cyc.num, cyc->cg.index);
136 CG.PROP.SELF+CG.PROP.CHILD, secondary key is NCALLS+CG.SELF_CALLS. *
    [all...]
mips.c 56 indirect_child.cg.prop.fract = 1.0;
57 indirect_child.cg.cyc.head = &indirect_child;
  /src/external/gpl3/binutils.old/dist/gprof/
cg_arcs.c 71 for (arc = parent->cg.children; arc; arc = arc->next_child)
135 arc->next_child = parent->cg.children;
136 parent->cg.children = arc;
139 arc->next_parent = child->cg.parents;
140 child->cg.parents = arc;
150 return left->cg.top_order - right->cg.top_order;
161 if (parent->cg.prop.fract == 0.0)
168 for (arc = parent->cg.children; arc; arc = arc->next_child)
171 if (arc->count == 0 || child == parent || child->cg.prop.fract == 0
    [all...]
cg_dfn.c 65 return child->cg.top_order != DFN_NAN && child->cg.top_order != DFN_BUSY;
75 if (child->cg.top_order == DFN_NAN)
104 if (child->cg.cyc.head != child && child->cg.cyc.head == head)
152 for (tail = head; tail->cg.cyc.next; tail = tail->cg.cyc.next)
165 if (head->cg.cyc.head != head)
167 head = head->cg.cyc.head;
175 if (child->cg.cyc.head == child
    [all...]
utils.c 91 DBG (DFNDEBUG, printf ("{%d} ", self->cg.top_order));
92 DBG (PROPDEBUG, printf ("%4.0f%% ", 100.0 * self->cg.prop.fract));
103 if (self->cg.cyc.num != 0)
105 printf (_(" <cycle %d>"), self->cg.cyc.num);
107 if (self->cg.index != 0)
109 if (self->cg.print_flag)
111 printf (" [%d]", self->cg.index);
115 printf (" (%d)", self->cg.index);
cg_print.c 120 sprintf (buf, "[%d]", cyc->cg.index);
124 100 * (cyc->cg.prop.self + cyc->cg.prop.child) / print_time,
125 cyc->cg.prop.self / hz, cyc->cg.prop.child / hz, cyc->ncalls);
127 if (cyc->cg.self_calls != 0)
128 printf ("+%-7lu", cyc->cg.self_calls);
132 printf (_(" <cycle %d as a whole> [%d]\n"), cyc->cg.cyc.num, cyc->cg.index);
136 CG.PROP.SELF+CG.PROP.CHILD, secondary key is NCALLS+CG.SELF_CALLS. *
    [all...]
mips.c 56 indirect_child.cg.prop.fract = 1.0;
57 indirect_child.cg.cyc.head = &indirect_child;
  /src/external/apache2/llvm/dist/llvm/include/llvm-c/
lto.h 210 * Loads an object file into the same context as \c cg. The module is safe to
219 const char *path, lto_code_gen_t cg);
387 * \c cg and \c mod must both be in the same context. See \a
394 lto_codegen_add_module(lto_code_gen_t cg, lto_module_t mod);
400 * \c cg and \c mod must both be in the same context.
405 lto_codegen_set_module(lto_code_gen_t cg, lto_module_t mod);
414 lto_codegen_set_debug_model(lto_code_gen_t cg, lto_debug_model);
423 lto_codegen_set_pic_model(lto_code_gen_t cg, lto_codegen_model);
431 lto_codegen_set_cpu(lto_code_gen_t cg, const char *cpu);
440 lto_codegen_set_assembler_path(lto_code_gen_t cg, const char* path)
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/lto/
lto.cpp 151 static void lto_add_attrs(lto_code_gen_t cg) {
152 LTOCodeGenerator *CG = unwrap(cg);
153 CG->setAttrs(codegen::getMAttrs());
157 CG->setOptLevel(OptLevel - '0');
158 CG->setFreestanding(EnableFreestanding);
159 CG->setDisableVerify(DisableVerify);
289 lto_code_gen_t cg) {
294 unwrap(cg)->getContext(), mem, length, Options, StringRef(path));
346 void lto_codegen_set_diagnostic_handler(lto_code_gen_t cg,
    [all...]
  /src/usr.sbin/makefs/ffs/
ffs_alloc.c 75 static int32_t ffs_mapsearch(struct fs *, struct cg *, daddr_t, int);
106 int cg; local
118 cg = ino_to_cg(fs, ip->i_number);
120 cg = dtog(fs, bpref);
121 bno = ffs_hashalloc(ip, cg, bpref, size, ffs_alloccg);
162 uint32_t cg, startcg; local
168 cg = ino_to_cg(fs, ip->i_number);
169 return (fs->fs_fpg * cg + fs->fs_frag);
183 for (cg = startcg; cg < fs->fs_ncg; cg++
201 uint32_t cg, startcg; local
446 int i, error, cg, blk, frags, bbase; local
    [all...]
ffs_extern.h 56 void ffs_clusteracct(struct fs *, struct cg *, int32_t, int);
66 void ffs_cg_swap(struct cg *, struct cg *, struct fs *);
  /src/external/apache2/mDNSResponder/dist/unittests/
uds_daemon_ut.c 12 const CacheGroup *cg; local
19 for (cg = mDNSStorage.rrcache_hash[slot]; cg; cg=cg->next)
22 for (cr = cg->members; cr; cr=cr->next)
  /src/sys/ufs/ext2fs/
ext2fs_alloc.c 122 int cg; local
139 cg = ino_to_cg(fs, ip->i_number);
141 cg = dtog(fs, bpref);
142 bno = (daddr_t)ext2fs_hashalloc(ip, cg, bpref, fs->e2fs_bsize,
177 int cg; local
185 cg = ext2fs_dirpref(fs);
187 cg = ino_to_cg(fs, pip->i_number);
188 ipref = cg * fs->e2fs.e2fs_ipg + 1;
189 ino = (ino_t)ext2fs_hashalloc(pip, cg, (long)ipref, mode, ext2fs_nodealloccg);
212 int cg, maxspace, mincg, avgifree local
251 int cg, i; local
521 int error, cg; local
569 int error, cg; local
861 int cg, i, error; local
    [all...]
  /src/sys/ufs/ffs/
ffs_alloc.c 118 static int32_t ffs_mapsearch(struct fs *, struct cg *,
182 u_int cg; local
255 cg = ino_to_cg(fs, ip->i_number);
257 cg = dtog(fs, bpref);
258 bno = ffs_hashalloc(ip, cg, bpref, size, 0, flags, ffs_alloccg);
314 u_int cg, request; local
404 cg = dtog(fs, bprev);
406 if ((bno = ffs_fragextend(ip, cg, bprev, osize, nsize)) != 0) {
490 bno = ffs_hashalloc(ip, cg, bpref, request, nsize, 0, ffs_alloccg);
575 u_int cg; local
642 u_int cg, prefcg; local
775 u_int cg; local
839 u_int cg; local
1187 int cg; local
1462 u_int cg; local
1567 u_int cg; local
1839 int error, cg; local
1878 u_int cg; local
2002 u_int cg; local
2039 int error, cg; local
2075 u_int cg; local
2125 u_int cg; local
    [all...]
ffs_extern.h 63 struct cg;
198 void ffs_cg_swap(struct cg *, struct cg *, struct fs *);
212 void ffs_clusteracct(struct fs *, struct cg *, int32_t, int);
  /src/sbin/fsck_ffs/
pass4.c 67 uint32_t cg; local
73 for (cg = 0; cg < sblock->fs_ncg; cg++) {
77 cdevname(), cg, sblock->fs_ncg,
78 cg * 100 / sblock->fs_ncg);
83 cg, sblock->fs_ncg);
85 inumber = cg * sblock->fs_ipg;
86 for (i = 0; i < inostathead[cg].il_numalloced; i++, inumber++) {
163 int cg, nfrags, res = KEEPON local
    [all...]
pass5.c 76 struct cg *newcg = (struct cg *)buf;
78 struct cg *cg = cgrp, *ncg; local
120 "cannot reallocate cg space");
121 cg = cgrp = ncg;
218 memcpy(cg, cgblk.b_un.b_cg, fs->fs_cgsize);
220 ffs_cg_swap(cgblk.b_un.b_cg, cg, sblock);
221 if (!doinglevel1 && !cg_chkmagic(cg, 0))
222 pfatal("CG %d: PASS5: BAD MAGIC NUMBER\n", c)
    [all...]
  /src/external/gpl3/binutils/dist/gprofng/src/
gmon_cg_arcs.cc 59 for (arc = parent->cg.children; arc; arc = arc->next_child)
123 arc->next_child = parent->cg.children;
124 parent->cg.children = arc;
127 arc->next_parent = child->cg.parents;
128 child->cg.parents = arc;
gmon_symtab.cc 69 sym->cg.child_time = 0.0;
70 sym->cg.prop.fract = 0.0;
71 sym->cg.prop.self = 0.0;
72 sym->cg.prop.child = 0.0;
  /src/sbin/resize_ffs/
resize_ffs.c 77 /* size of a cg, in bytes, rounded up to a frag boundary */
108 /* a cg's worth of brand new squeaky-clean inodes */
113 static struct cg **cgs;
118 /* per-cg flags, indexed by cg number */
325 * them into and initializes the per-cg flags.
330 uint32_t cg; local
334 cgs = nfmalloc(oldsb->fs_ncg * sizeof(*cgs), "cg pointers");
336 cgflags = nfmalloc(oldsb->fs_ncg, "cg flags");
337 csums = nfmalloc(oldsb->fs_cssize, "cg summary")
465 struct cg *cg; \/* The in-core cg, of course *\/ local
1051 struct cg *cg; local
1810 struct cg *cg; local
1867 struct cg *cg; local
1985 struct cg *cg; local
    [all...]
  /src/sbin/badsect/
badsect.c 79 struct cg cg; member in union:__anon634
82 #define acg ucg.cg
206 int cg; local
217 cg = (int)dtog(fs, fsbn);
218 if (fsbn < cgdmin(fs, cg)) {
219 if (cg == 0 || fsbe > cgsblock(fs, cg)) {
225 if (fsbe > cgbase(fs, cg + 1)) {
232 rdfs(FFS_FSBTODB(fs, cgtod(fs, cg)), (int)sblock.fs_cgsize, &acg)
    [all...]
  /src/sbin/dump/
ffs_inode.c 172 int i, cg, inosused; local
173 struct cg *cgp;
180 for (cg = 0; cg < sblock->fs_ncg; cg++) {
181 ino = cg * sblock->fs_ipg;
182 bread(FFS_FSBTODB(sblock, cgtod(sblock, cg)), (char *)cgp,
199 quit("%s: cg %d: bad magic number\n",
200 __func__, cg);

Completed in 51 milliseconds

1 2 3 4