Home
last modified time | relevance | path

Searched full:gp (Results 1 – 25 of 552) sorted by relevance

12345678910>>...23

/freebsd/contrib/llvm-project/compiler-rt/lib/tsan/rtl/
H A Dtsan_rtl_mips64.S15 sd $gp,8($sp)
18 lui $gp,%hi(%neg(%gp_rel(setjmp)))
19 daddu $gp,$gp,$t9
20 daddiu $gp,$gp,%lo(%neg(%gp_rel(setjmp)))
21 move $s0,$gp
36 // restore gp
37 move $gp,$s0
43 ld $gp,8($sp)
67 sd $gp,8($sp)
70 lui $gp,%hi(%neg(%gp_rel(_setjmp)))
[all …]
/freebsd/contrib/nvi/cl/
H A Dcl_main.c52 GS *gp; in main() local
62 __global_list = gp = gs_init(); in main()
82 clp = cl_init(gp); in main()
95 if ((OG_D_STR(gp, GO_TERM) = in main()
96 OG_STR(gp, GO_TERM) = strdup(ttype)) == NULL) in main()
104 OG_VAL(gp, GO_LINES) = OG_D_VAL(gp, GO_LINES) = rows; in main()
105 OG_VAL(gp, GO_COLUMNS) = OG_D_VAL(gp, GO_COLUMNS) = cols; in main()
111 if (sig_init(gp, NULL)) in main()
115 rval = editor(gp, argc, argv); in main()
118 sig_end(gp); in main()
[all …]
/freebsd/sys/geom/mountver/
H A Dg_mountver.c63 static int g_mountver_destroy(struct g_geom *gp, boolean_t force);
66 struct g_geom *gp);
70 struct g_geom *gp, struct g_consumer *cp, struct g_provider *pp);
99 struct g_geom *gp; in g_mountver_done() local
104 gp = cp->geom; in g_mountver_done()
117 KASSERT(pbp->bio_to == LIST_FIRST(&gp->provider), in g_mountver_done()
124 sc = gp->softc; in g_mountver_done()
136 g_mountver_send(struct g_geom *gp, struct bio *bp) in g_mountver_send() argument
138 struct g_mountver_softc *sc = gp->softc; in g_mountver_send()
149 cp = LIST_FIRST(&gp->consumer); in g_mountver_send()
[all …]
/freebsd/sys/geom/
H A Dgeom_subr.c127 struct g_geom *gp; in g_load_class() local
171 LIST_FOREACH(gp, &mp2->geom, geom) { in g_load_class()
172 LIST_FOREACH(pp, &gp->provider, provider) { in g_load_class()
183 struct g_geom *gp; in g_unload_class() local
192 LIST_FOREACH(gp, &mp->geom, geom) { in g_unload_class()
194 LIST_FOREACH(pp, &gp->provider, provider) in g_unload_class()
199 LIST_FOREACH(cp, &gp->consumer, consumer) in g_unload_class()
205 if (gp->flags & G_GEOM_WITHER) { in g_unload_class()
223 LIST_FOREACH(gp, &mp->geom, geom) { in g_unload_class()
224 error = mp->destroy_geom(NULL, mp, gp); in g_unload_class()
[all …]
H A Dgeom_dump.c69 g_confdot_geom(struct sbuf *sb, struct g_geom *gp) in g_confdot_geom() argument
75 gp, gp->class->name, gp->name, gp->rank); in g_confdot_geom()
76 LIST_FOREACH(cp, &gp->consumer, consumer) { in g_confdot_geom()
78 sbuf_printf(sb, "z%p -> z%p;\n", gp, cp); in g_confdot_geom()
81 LIST_FOREACH(pp, &gp->provider, provider) { in g_confdot_geom()
83 sbuf_printf(sb, "z%p -> z%p;\n", pp, gp); in g_confdot_geom()
90 struct g_geom *gp; in g_confdot_class() local
92 LIST_FOREACH(gp, &mp->geom, geom) in g_confdot_class()
93 g_confdot_geom(sb, gp); in g_confdot_class()
113 g_conftxt_geom(struct sbuf *sb, struct g_geom *gp, int level) in g_conftxt_geom() argument
[all …]
H A Dgeom_slice.c72 g_slice_free(struct g_geom *gp) in g_slice_free() argument
76 gsp = gp->softc; in g_slice_free()
77 gp->softc = NULL; in g_slice_free()
97 struct g_geom *gp; in g_slice_access() local
103 gp = pp->geom; in g_slice_access()
104 cp = LIST_FIRST(&gp->consumer); in g_slice_access()
106 gsp = gp->softc; in g_slice_access()
139 if (error == 0 && (gp->flags & G_GEOM_WITHER) != 0 && in g_slice_access()
141 g_slice_free(gp); in g_slice_access()
157 struct g_geom *gp; in g_slice_finish_hot() local
[all …]
/freebsd/contrib/nvi/vi/
H A Dvs_msg.c57 GS *gp; in vs_busy() local
69 gp = sp->gp; in vs_busy()
89 (void)gp->scr_cursor(sp, &vip->busy_oldy, &vip->busy_oldx); in vs_busy()
93 (void)gp->scr_move(sp, LASTLINE(sp), 0); in vs_busy()
94 (void)gp->scr_addstr(sp, p, len); in vs_busy()
95 (void)gp->scr_cursor(sp, &notused, &vip->busy_fx); in vs_busy()
96 (void)gp->scr_clrtoeol(sp); in vs_busy()
97 (void)gp->scr_move(sp, LASTLINE(sp), vip->busy_fx); in vs_busy()
109 (void)gp->scr_move(sp, LASTLINE(sp), 0); in vs_busy()
110 (void)gp->scr_clrtoeol(sp); in vs_busy()
[all …]
H A Dvs_split.c29 static void vs_insert(SCR *sp, GS *gp);
44 GS *gp; in vs_split() local
49 gp = sp->gp; in vs_split()
171 vs_insert(new, sp->gp); in vs_split()
174 (void)gp->scr_split(sp, new); in vs_split()
206 GS *gp; in vs_vsplit() local
209 gp = sp->gp; in vs_vsplit()
259 vs_insert(new, sp->gp); in vs_vsplit()
262 (void)gp->scr_split(sp, new); in vs_vsplit()
294 vs_insert(SCR *sp, GS *gp) in vs_insert() argument
[all …]
/freebsd/sys/geom/multipath/
H A Dg_multipath.c125 g_multipath_good(struct g_geom *gp) in g_multipath_good() argument
130 LIST_FOREACH(cp, &gp->consumer, consumer) { in g_multipath_good()
142 struct g_geom *gp; in g_multipath_fault() local
144 gp = cp->geom; in g_multipath_fault()
145 sc = gp->softc; in g_multipath_fault()
147 if (g_multipath_good(gp) == 0 && sc->sc_ndisks > 0) { in g_multipath_fault()
148 LIST_FOREACH(lcp, &gp->consumer, consumer) { in g_multipath_fault()
165 LIST_FOREACH(lcp, &gp->consumer, consumer) { in g_multipath_fault()
181 g_multipath_choose(struct g_geom *gp, struct bio *bp) in g_multipath_choose() argument
186 sc = gp->softc; in g_multipath_choose()
[all …]
/freebsd/sys/geom/uzip/
H A Dg_uzip.c145 g_uzip_softc_free(struct g_geom *gp) in g_uzip_softc_free() argument
147 struct g_uzip_softc *sc = gp->softc; in g_uzip_softc_free()
150 gp->name, sc->req_total, sc->req_cached)); in g_uzip_softc_free()
167 gp->softc = NULL; in g_uzip_softc_free()
171 g_uzip_cached(struct g_geom *gp, struct bio *bp) in g_uzip_cached() argument
177 sc = gp->softc; in g_uzip_cached()
192 "from cache\n", __func__, gp->name, bp, (intmax_t)ofs, in g_uzip_cached()
221 g_uzip_request(struct g_geom *gp, struct bio *bp) in g_uzip_request() argument
230 if (g_uzip_cached(gp, bp) != 0) in g_uzip_request()
233 sc = gp->softc; in g_uzip_request()
[all …]
/freebsd/contrib/nvi/common/
H A Dkey.c103 GS *gp; in v_key_init() local
107 gp = sp->gp; in v_key_init()
121 gp->special_key[kp->ch] = kp->value; in v_key_init()
126 gp->noprint = ch; in v_key_init()
129 if (ch != gp->noprint) { in v_key_init()
152 if (sp->gp->scr_keyval(sp, name, &ch, &dne)) in v_keyval()
183 GS *gp; in v_key_ilookup() local
186 for (gp = sp->gp, ch = 0;; ++ch) { in v_key_ilookup()
187 for (p = gp->cname[ch].name, t = v_key_name(sp, ch), in v_key_ilookup()
188 len = gp->cname[ch].len = sp->clen; len--;) in v_key_ilookup()
[all …]
H A Dmain.c40 editor(GS *gp, int argc, char *argv[]) in editor() argument
56 if (gp->scr_busy == NULL) in editor()
57 gp->scr_busy = vs_busy; in editor()
59 if (gp->scr_msg == NULL) in editor()
60 gp->scr_msg = vs_msg; in editor()
61 gp->catd = (nl_catd)-1; in editor()
64 TAILQ_INIT(gp->dq); in editor()
65 TAILQ_INIT(gp->hq); in editor()
66 SLIST_INIT(gp->ecq); in editor()
67 SLIST_INSERT_HEAD(gp->ecq, &gp->excmd, q); in editor()
[all …]
H A Doptions.h27 (sp)->gp->opts[(sp)->opts[(o)].o_cur.val].fld : \
31 #define OG_CLR(gp, o) ((gp)->opts[(o)].o_cur.val) = 0 argument
32 #define OG_SET(gp, o) ((gp)->opts[(o)].o_cur.val) = 1 argument
33 #define OG_STR(gp, o) ((gp)->opts[(o)].o_cur.str) argument
34 #define OG_VAL(gp, o) ((gp)->opts[(o)].o_cur.val) argument
35 #define OG_ISSET(gp, o) OG_VAL(gp, o) argument
37 #define OG_D_STR(gp, o) ((gp)->opts[(o)].o_def.str) argument
38 #define OG_D_VAL(gp, o) ((gp)->opts[(o)].o_def.val) argument
/freebsd/sys/geom/bde/
H A Dg_bde.c
/freebsd/sys/geom/shsec/
H A Dg_shsec.c52 struct g_geom *gp);
177 struct g_geom *gp; in g_shsec_orphan() local
180 gp = cp->geom; in g_shsec_orphan()
181 sc = gp->softc; in g_shsec_orphan()
187 if (LIST_EMPTY(&gp->consumer)) in g_shsec_orphan()
196 struct g_geom *gp; in g_shsec_access() local
199 gp = pp->geom; in g_shsec_access()
200 sc = gp->softc; in g_shsec_access()
210 LIST_FOREACH_SAFE(cp1, &gp->consumer, consumer, tmp) { in g_shsec_access()
222 if (LIST_EMPTY(&gp->consumer)) in g_shsec_access()
[all …]
/freebsd/sys/geom/part/
H A Dg_part.c295 struct g_geom *gp; in g_part_get_physpath_done() local
303 gp = pp->geom; in g_part_get_physpath_done()
304 table = gp->softc; in g_part_get_physpath_done()
471 g_part_new_provider(struct g_geom *gp, struct g_part_table *table, in g_part_new_provider() argument
479 cp = LIST_FIRST(&gp->consumer); in g_part_new_provider()
487 entry->gpe_pp = G_PART_NEW_PROVIDER(table, gp, entry, gp->name); in g_part_new_provider()
516 struct g_geom *gp; in g_part_find_geom() local
517 LIST_FOREACH(gp, &g_part_class.geom, geom) { in g_part_find_geom()
518 if ((gp->flags & G_GEOM_WITHER) == 0 && in g_part_find_geom()
519 strcmp(name, gp->name) == 0) in g_part_find_geom()
[all …]
/freebsd/sys/geom/nop/
H A Dg_nop.c52 static int g_nop_destroy(struct g_geom *gp, boolean_t force);
54 struct g_geom *gp);
109 struct g_geom *gp; in g_nop_resize() local
115 gp = cp->geom; in g_nop_resize()
116 sc = gp->softc; in g_nop_resize()
121 g_nop_destroy(gp, 1); in g_nop_resize()
125 LIST_FOREACH(pp, &gp->provider, provider) in g_nop_resize()
140 struct g_geom *gp; in g_nop_kerneldump() local
144 gp = bp->bio_to->geom; in g_nop_kerneldump()
145 g_trace(G_T_TOPOLOGY, "%s(%s, %jd, %jd)", __func__, gp->name, in g_nop_kerneldump()
[all …]
/freebsd/sys/geom/concat/
H A Dg_concat.c57 struct g_geom *gp);
156 struct g_geom *gp; in g_concat_orphan() local
159 gp = cp->geom; in g_concat_orphan()
160 sc = gp->softc; in g_concat_orphan()
175 struct g_geom *gp; in g_concat_access() local
180 gp = pp->geom; in g_concat_access()
181 sc = gp->softc; in g_concat_access()
191 LIST_FOREACH_SAFE(cp1, &gp->consumer, consumer, tmp) { in g_concat_access()
206 LIST_FOREACH(cp2, &gp->consumer, consumer) { in g_concat_access()
532 struct g_geom *gp; in g_concat_add_disk() local
[all …]
/freebsd/sbin/geom/core/
H A Dgeom.c677 struct ggeom *gp; in find_geom_by_provider() local
681 LIST_FOREACH(gp, &classp->lg_geom, lg_geom) { in find_geom_by_provider()
682 LIST_FOREACH(pp, &gp->lg_provider, lg_provider) { in find_geom_by_provider()
684 return (gp); in find_geom_by_provider()
693 compute_tree_width_geom(struct gmesh *mesh, struct ggeom *gp, int indent) in compute_tree_width_geom() argument
701 max_width = width = indent + strlen(gp->lg_name); in compute_tree_width_geom()
703 LIST_FOREACH(pp, &gp->lg_provider, lg_provider) { in compute_tree_width_geom()
726 struct ggeom *gp; in compute_tree_width() local
732 LIST_FOREACH(gp, &classp->lg_geom, lg_geom) { in compute_tree_width()
733 if (!LIST_EMPTY(&gp->lg_consumer)) in compute_tree_width()
[all …]
/freebsd/sys/geom/stripe/
H A Dg_stripe.c52 struct g_geom *gp);
188 struct g_geom *gp; in g_stripe_orphan() local
191 gp = cp->geom; in g_stripe_orphan()
192 sc = gp->softc; in g_stripe_orphan()
204 struct g_geom *gp; in g_stripe_access() local
208 gp = pp->geom; in g_stripe_access()
209 sc = gp->softc; in g_stripe_access()
219 LIST_FOREACH_SAFE(cp1, &gp->consumer, consumer, tmp) { in g_stripe_access()
231 LIST_FOREACH(cp2, &gp->consumer, consumer) { in g_stripe_access()
750 struct g_geom *gp; in g_stripe_add_disk() local
[all …]
/freebsd/sys/geom/label/
H A Dg_label.c60 struct g_geom *gp);
61 static int g_label_destroy(struct g_geom *gp, boolean_t force);
130 struct g_geom *gp __unused) in g_label_destroy_geom()
225 struct g_geom *gp; in g_label_create() local
240 gp = NULL; in g_label_create()
247 LIST_FOREACH(gp, &mp->geom, geom) { in g_label_create()
248 pp2 = LIST_FIRST(&gp->provider); in g_label_create()
263 gp = g_slice_new(mp, 1, pp, &cp, NULL, 0, NULL); in g_label_create()
264 if (gp == NULL) { in g_label_create()
270 gp->orphan = g_label_orphan; in g_label_create()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_trampoline_mips64.S27 sd $gp, 128($sp)
45 lui $gp, %hi(%neg(%gp_rel(__xray_FunctionEntry)))
46 daddu $gp, $gp, $t9
47 daddiu $gp ,$gp, %lo(%neg(%gp_rel(__xray_FunctionEntry)))
78 ld $gp, 128($sp)
97 sd $gp, 48($sp)
105 lui $gp, %hi(%neg(%gp_rel(__xray_FunctionExit)))
106 daddu $gp, $gp, $t9
107 daddiu $gp ,$gp, %lo(%neg(%gp_rel(__xray_FunctionExit)))
128 ld $gp, 48($sp)
/freebsd/lib/geom/part/
H A Dgeom_part.c211 struct ggeom *gp, *wgp; in find_geom() local
216 LIST_FOREACH(gp, &classp->lg_geom, lg_geom) { in find_geom()
217 if (strcmp(gp->lg_name, name) != 0) in find_geom()
219 if (!geom_is_withered(gp)) in find_geom()
220 return (gp); in find_geom()
222 wgp = gp; in find_geom()
228 geom_is_withered(struct ggeom *gp) in geom_is_withered() argument
232 LIST_FOREACH(gc, &gp->lg_config, lg_config) { in geom_is_withered()
240 find_geomcfg(struct ggeom *gp, const char *cfg) in find_geomcfg() argument
244 LIST_FOREACH(gc, &gp->lg_config, lg_config) { in find_geomcfg()
[all …]
/freebsd/sys/geom/cache/
H A Dg_cache.c345 struct g_geom *gp; in g_cache_start() local
349 gp = bp->bio_to->geom; in g_cache_start()
350 sc = gp->softc; in g_cache_start()
401 g_io_request(cbp, LIST_FIRST(&gp->consumer)); in g_cache_start()
436 struct g_geom *gp; in g_cache_access() local
440 gp = pp->geom; in g_cache_access()
441 cp = LIST_FIRST(&gp->consumer); in g_cache_access()
458 struct g_geom *gp; in g_cache_find_device() local
460 LIST_FOREACH(gp, &mp->geom, geom) { in g_cache_find_device()
461 if (strcmp(gp->name, name) == 0) in g_cache_find_device()
[all …]
/freebsd/share/man/man4/
H A Dudbc.428 interface class is Diagnostic Class and the subclass is DbC.GP.
42 The supported class in USB xHCs is typically DbC.GP,
44 The DbC.GP uses IN and OUT endpoint pairs and realizes a single
49 the DbC.GP is seen as a simple serial device.
51 Most systems with USB xHC can be configured to provide DbC.GP access.
54 is a driver that connects to DbC.GP-supported devices,
61 A native DbC.GP device can be attached using the
65 A USB xHC DbC.GP device on a target system needs a special hardware
67 There is one method to expose DbC.GP is to use a USB 3.1 A-to-A cable
73 driver can find a DbC.GP device on that port.

12345678910>>...23