Searched refs:split (Results 1 - 200 of 891) sorted by relevance

12345

/linux-4.1.27/drivers/media/dvb-core/
H A Ddvb_ringbuffer.c114 size_t split; dvb_ringbuffer_read_user() local
116 split = (rbuf->pread + len > rbuf->size) ? rbuf->size - rbuf->pread : 0; dvb_ringbuffer_read_user()
117 if (split > 0) { dvb_ringbuffer_read_user()
118 if (copy_to_user(buf, rbuf->data+rbuf->pread, split)) dvb_ringbuffer_read_user()
120 buf += split; dvb_ringbuffer_read_user()
121 todo -= split; dvb_ringbuffer_read_user()
135 size_t split; dvb_ringbuffer_read() local
137 split = (rbuf->pread + len > rbuf->size) ? rbuf->size - rbuf->pread : 0; dvb_ringbuffer_read()
138 if (split > 0) { dvb_ringbuffer_read()
139 memcpy(buf, rbuf->data+rbuf->pread, split); dvb_ringbuffer_read()
140 buf += split; dvb_ringbuffer_read()
141 todo -= split; dvb_ringbuffer_read()
153 size_t split; dvb_ringbuffer_write() local
155 split = (rbuf->pwrite + len > rbuf->size) ? rbuf->size - rbuf->pwrite : 0; dvb_ringbuffer_write()
157 if (split > 0) { dvb_ringbuffer_write()
158 memcpy(rbuf->data+rbuf->pwrite, buf, split); dvb_ringbuffer_write()
159 buf += split; dvb_ringbuffer_write()
160 todo -= split; dvb_ringbuffer_write()
174 size_t split; dvb_ringbuffer_write_user() local
176 split = (rbuf->pwrite + len > rbuf->size) ? rbuf->size - rbuf->pwrite : 0; dvb_ringbuffer_write_user()
178 if (split > 0) { dvb_ringbuffer_write_user()
179 status = copy_from_user(rbuf->data+rbuf->pwrite, buf, split); dvb_ringbuffer_write_user()
182 buf += split; dvb_ringbuffer_write_user()
183 todo -= split; dvb_ringbuffer_write_user()
212 size_t split; dvb_ringbuffer_pkt_read_user() local
222 split = ((idx + len) > rbuf->size) ? rbuf->size - idx : 0; dvb_ringbuffer_pkt_read_user()
223 if (split > 0) { dvb_ringbuffer_pkt_read_user()
224 if (copy_to_user(buf, rbuf->data+idx, split)) dvb_ringbuffer_pkt_read_user()
226 buf += split; dvb_ringbuffer_pkt_read_user()
227 todo -= split; dvb_ringbuffer_pkt_read_user()
240 size_t split; dvb_ringbuffer_pkt_read() local
250 split = ((idx + len) > rbuf->size) ? rbuf->size - idx : 0; dvb_ringbuffer_pkt_read()
251 if (split > 0) { dvb_ringbuffer_pkt_read()
252 memcpy(buf, rbuf->data+idx, split); dvb_ringbuffer_pkt_read()
253 buf += split; dvb_ringbuffer_pkt_read()
254 todo -= split; dvb_ringbuffer_pkt_read()
/linux-4.1.27/arch/powerpc/platforms/powernv/
H A Dsubcore.c33 * A core can be in one of three states, unsplit, 2-way split, and 4-way split.
40 * 2-way split | 2
41 * 4-way split | 4
43 * The core is split along thread boundaries, the mapping between subcores and
53 * 2-way split:
60 * 4-way split:
71 * It is not possible to transition between either of the split states, the
75 * | | <----> | 2-way split |
79 * | | <----> | 4-way split |
105 * complicated by the fact that after the split occurs, the newly created
109 * means they must not be running in virtual mode when the split occurs. The
116 * to see the core split.
121 * to request the split, and spins waiting to see that the split has happened.
123 * Concurrently the secondaries will notice the split. When they do they set up
133 * offline loop and do a split or unsplit.
135 * 0 - no split happening
137 * 2 - split to 2 in progress
138 * 4 - split to 4 in progress
335 pr_err("Unable to change split core mode while KVM active.\n"); set_subcores_per_core()
414 * We need all threads in a core to be present to split/unsplit so subcore_init()
H A Dsubcore-asm.S53 /* Order reading the SPRs vs telling the primary we are ready to split */
63 /* Loop until we see the split happen in HID0 */
79 /* Restore SPR values now we are split */
H A Dsubcore.h14 #define SYNC_STEP_FINISHED 3 /* Set by secondary when split/unsplit is done */
/linux-4.1.27/arch/s390/include/asm/
H A Ddma.h8 * to DMA. It _is_ used for the s390 memory zone split at 2GB caused
H A Dtimex.h147 * With a split todval == 2^32 * th + tl (th upper 32 bits, tl lower 32 bits)
/linux-4.1.27/security/apparmor/
H A Dlib.c25 * aa_split_fqname - split a fqname into a profile and namespace name
44 char *split = strchr(&name[1], ':'); aa_split_fqname() local
46 if (split) { aa_split_fqname()
48 *split++ = 0; aa_split_fqname()
49 if (strncmp(split, "//", 2) == 0) aa_split_fqname()
50 split += 2; aa_split_fqname()
51 name = skip_spaces(split); aa_split_fqname()
H A Dpolicy.c110 char *split; hname_tail() local
112 for (split = strstr(hname, "//"); split; split = strstr(hname, "//")) hname_tail()
113 hname = split + 2; hname_tail()
794 char *split; __lookup_parent() local
798 for (split = strstr(hname, "//"); split;) { __lookup_parent()
800 split - hname); __lookup_parent()
804 hname = split + 2; __lookup_parent()
805 split = strstr(hname, "//"); __lookup_parent()
827 char *split; __lookup_profile() local
829 for (split = strstr(hname, "//"); split;) { __lookup_profile()
831 split - hname); __lookup_profile()
836 hname = split + 2; __lookup_profile()
837 split = strstr(hname, "//"); __lookup_profile()
/linux-4.1.27/arch/x86/oprofile/
H A Dop_model_ppro.c86 if (!(eax.split.version_id == 0 && ppro_setup_ctrs()
90 if (counter_width < eax.split.bit_width) ppro_setup_ctrs()
91 counter_width = eax.split.bit_width; ppro_setup_ctrs()
215 if (eax.split.version_id == 0 && __this_cpu_read(cpu_info.x86) == 6 && arch_perfmon_setup_counters()
217 eax.split.version_id = 2; arch_perfmon_setup_counters()
218 eax.split.num_counters = 2; arch_perfmon_setup_counters()
219 eax.split.bit_width = 40; arch_perfmon_setup_counters()
222 num_counters = min((int)eax.split.num_counters, OP_MAX_COUNTER); arch_perfmon_setup_counters()
/linux-4.1.27/Documentation/trace/
H A Dfunction-graph-fold.vim29 let s = split(getline(v:foldstart), '|', 1)
33 let e = split(getline(v:foldend), '|', 1)
/linux-4.1.27/sound/usb/line6/
H A Dmidibuf.h18 int split; member in struct:midi_buffer
28 extern int line6_midibuf_init(struct midi_buffer *mb, int size, int split);
H A Dmidibuf.c57 int line6_midibuf_init(struct midi_buffer *this, int size, int split) line6_midibuf_init() argument
65 this->split = split; line6_midibuf_init()
208 if (!this->split) line6_midibuf_read()
/linux-4.1.27/arch/cris/include/arch-v32/arch/
H A Dchecksum.h9 * checksum. Which means it would be necessary to split all those into
/linux-4.1.27/drivers/md/
H A Dlinear.c263 struct bio *split; linear_make_request() local
284 * split it. linear_make_request()
286 split = bio_split(bio, end_sector - linear_make_request()
289 bio_chain(split, bio); linear_make_request()
291 split = bio; linear_make_request()
294 split->bi_iter.bi_sector = split->bi_iter.bi_sector - linear_make_request()
297 if (unlikely((split->bi_rw & REQ_DISCARD) && linear_make_request()
298 !blk_queue_discard(bdev_get_queue(split->bi_bdev)))) { linear_make_request()
300 bio_endio(split, 0); linear_make_request()
302 generic_make_request(split); linear_make_request()
303 } while (split != bio); linear_make_request()
H A Draid0.c514 struct bio *split; raid0_make_request() local
534 split = bio_split(bio, sectors, GFP_NOIO, fs_bio_set); raid0_make_request()
535 bio_chain(split, bio); raid0_make_request()
537 split = bio; raid0_make_request()
542 split->bi_bdev = tmp_dev->bdev; raid0_make_request()
543 split->bi_iter.bi_sector = sector + zone->dev_start + raid0_make_request()
546 if (unlikely((split->bi_rw & REQ_DISCARD) && raid0_make_request()
547 !blk_queue_discard(bdev_get_queue(split->bi_bdev)))) { raid0_make_request()
549 bio_endio(split, 0); raid0_make_request()
551 generic_make_request(split); raid0_make_request()
552 } while (split != bio); raid0_make_request()
/linux-4.1.27/fs/btrfs/tests/
H A Dextent-buffer-tests.c78 * space in this leaf to split the item without having to split the test_btrfs_split_item()
101 test_msg("Invalid len in the first split\n"); test_btrfs_split_item()
110 "in the first split have='%.*s' want '%s'\n", test_btrfs_split_item()
126 test_msg("Invalid len in the second split\n"); test_btrfs_split_item()
135 "in the second split\n"); test_btrfs_split_item()
144 test_msg("Second split item failed %d\n", ret); test_btrfs_split_item()
158 test_msg("Invalid len in the first split\n"); test_btrfs_split_item()
167 "in the third split"); test_btrfs_split_item()
182 test_msg("Invalid len in the second split\n"); test_btrfs_split_item()
191 "in the fourth split\n"); test_btrfs_split_item()
206 test_msg("Invalid len in the second split\n"); test_btrfs_split_item()
H A Dinode-tests.c89 * [hole ][inline][ hole ][ regular ][regular1 split][ hole ]
92 * [regular1 split][ prealloc1 ][prealloc1 written][ prealloc1 ][ compressed ]
137 * Now for 3 extents that were split from a hole punch so we test setup_file_extents()
193 /* Now a split compressed extent */ setup_file_extents()
394 /* The next 3 are split extents */ test_btrfs_get_extent()
/linux-4.1.27/fs/jfs/
H A Djfs_xtree.c109 uint split; member in struct:__anon11031
122 struct xtsplit * split, struct btstack * btstack);
124 static int xtSplitPage(tid_t tid, struct inode *ip, struct xtsplit * split,
128 struct xtsplit * split, struct metapage ** rmpp);
251 int nsplit = 0; /* number of pages to split */ xtSearch()
348 /* compute number of pages to split */ xtSearch()
395 /* compute number of pages to split */ xtSearch()
453 /* compute number of pages to split */ xtSearch()
495 /* update number of pages to split */ xtSearch()
548 struct xtsplit split; /* split information */ xtInsert() local
603 * if the leaf page is full, split the page and xtInsert()
604 * propagate up the router entry for the new page from split xtInsert()
610 split.mp = mp; xtInsert()
611 split.index = index; xtInsert()
612 split.flag = xflag; xtInsert()
613 split.off = xoff; xtInsert()
614 split.len = xlen; xtInsert()
615 split.addr = xaddr; xtInsert()
616 split.pxdlist = NULL; xtInsert()
617 if ((rc = xtSplitUp(tid, ip, &split, &btstack))) { xtInsert()
677 * split full pages as propagating insertion up the tree
682 * split - entry parameter descriptor;
689 struct inode *ip, struct xtsplit * split, struct btstack * btstack) xtSplitUp()
693 xtpage_t *sp; /* split page */ xtSplitUp()
705 int nsplit; /* number of pages split */ xtSplitUp()
711 smp = split->mp; xtSplitUp()
729 skip = split->index; xtSplitUp()
737 XT_PUTENTRY(xad, split->flag, split->off, split->len, xtSplitUp()
738 split->addr); xtSplitUp()
758 * allocate new index blocks to cover index page split(s) xtSplitUp()
762 if (split->pxdlist == NULL) { xtSplitUp()
764 split->pxdlist = &pxdlist; xtSplitUp()
789 * The split routines insert the new entry into the leaf page, xtSplitUp()
794 xtSplitRoot(tid, ip, split, &rmp) : xtSplitUp()
795 xtSplitPage(tid, ip, split, &rmp, &rbn); xtSplitUp()
802 * propagate up the router entry for the leaf page just split xtSplitUp()
805 * propagate the insert/split up the tree by walking back the stack xtSplitUp()
807 * that were traversed during the search for the page that split. xtSplitUp()
809 * the propagation of insert/split up the tree stops if the root xtSplitUp()
810 * splits or the page inserted into doesn't have to split to hold xtSplitUp()
813 * the parent entry for the split page remains the same, and xtSplitUp()
842 * because the split was to the right. xtSplitUp()
847 * split or shift right remaining entries of the parent page xtSplitUp()
851 * parent page is full - split the parent page xtSplitUp()
854 /* init for parent page split */ xtSplitUp()
855 split->mp = smp; xtSplitUp()
856 split->index = skip; /* index at insert */ xtSplitUp()
857 split->flag = XAD_NEW; xtSplitUp()
858 split->off = offsetXAD(&rcp->xad[XTENTRYSTART]); xtSplitUp()
859 split->len = JFS_SBI(ip->i_sb)->nbperpage; xtSplitUp()
860 split->addr = rcbn; xtSplitUp()
865 /* The split routines insert the new entry, xtSplitUp()
870 xtSplitRoot(tid, ip, split, &rmp) : xtSplitUp()
871 xtSplitPage(tid, ip, split, &rmp, &rbn); xtSplitUp()
943 * split a full non-root page into
944 * original/split/left page and new right page
945 * i.e., the original/split page remains as left page.
950 * struct xtsplit *split,
959 struct xtsplit * split, struct metapage ** rmpp, s64 * rbnp) xtSplitPage()
978 smp = split->mp; xtSplitPage()
981 INCREMENT(xtStat.split); xtSplitPage()
983 pxdlist = split->pxdlist; xtSplitPage()
996 * allocate the new right page for the split xtSplitPage()
1027 * acquire a transaction lock on the split page xtSplitPage()
1041 skip = split->index; xtSplitPage()
1050 * if we're wrong it's no big deal - we will do the split the right xtSplitPage()
1053 * reverse sorted data, that is, split the tree left, but it's not. xtSplitPage()
1064 XT_PUTENTRY(xad, split->flag, split->off, split->len, xtSplitPage()
1065 split->addr); xtSplitPage()
1114 * split the data between the split and new/right pages xtSplitPage()
1121 * skip index in old split/left page - insert into left page: xtSplitPage()
1124 /* move right half of split page to the new right page */ xtSplitPage()
1135 XT_PUTENTRY(xad, split->flag, split->off, split->len, xtSplitPage()
1136 split->addr); xtSplitPage()
1160 XT_PUTENTRY(xad, split->flag, split->off, split->len, xtSplitPage()
1161 split->addr); xtSplitPage()
1208 * split the full root page into original/root/split page and new
1212 * non-root page, and the split root page contains a single entry
1218 * struct xtsplit *split,
1226 struct inode *ip, struct xtsplit * split, struct metapage ** rmpp) xtSplitRoot()
1242 INCREMENT(xtStat.split); xtSplitRoot()
1247 pxdlist = split->pxdlist; xtSplitRoot()
1293 skip = split->index; xtSplitRoot()
1300 XT_PUTENTRY(xad, split->flag, split->off, split->len, split->addr); xtSplitRoot()
1323 * action: root split; xtSplitRoot()
1325 BT_MARK_DIRTY(split->mp, ip); xtSplitRoot()
1337 tlck = txLock(tid, ip, split->mp, tlckXTREE | tlckGROW); xtSplitRoot()
1372 struct xtsplit split; /* split information */ xtExtend() local
1427 * propagate up the router entry for the new page from split xtExtend()
1433 split.mp = mp; xtExtend()
1434 split.index = index + 1; xtExtend()
1435 split.flag = XAD_NEW; xtExtend()
1436 split.off = xoff; /* split offset */ xtExtend()
1437 split.len = len; xtExtend()
1438 split.addr = xaddr; xtExtend()
1439 split.pxdlist = NULL; xtExtend()
1440 if ((rc = xtSplitUp(tid, ip, &split, &btstack))) xtExtend()
1448 * if leaf root has been split, original root has been xtExtend()
1513 * function: split existing 'tail' extent
1514 * (split offset >= start offset of tail extent), and
1515 * relocate and extend the split tail half;
1520 * update pmap: free old split tail extent, alloc new extent;
1523 struct inode *ip, s64 xoff, /* split/new extent offset */ xtTailgate()
1535 struct xtsplit split; /* split information */ xtTailgate() local
1592 * propagate up the router entry for the new page from split xtTailgate()
1598 split.mp = mp; xtTailgate()
1599 split.index = index + 1; xtTailgate()
1600 split.flag = XAD_NEW; xtTailgate()
1601 split.off = xoff; /* split offset */ xtTailgate()
1602 split.len = xlen; xtTailgate()
1603 split.addr = xaddr; xtTailgate()
1604 split.pxdlist = NULL; xtTailgate()
1605 if ((rc = xtSplitUp(tid, ip, &split, &btstack))) xtTailgate()
1613 * if leaf root has been split, original root has been xtTailgate()
1652 * truncate/relocate old extent at split offset xtTailgate()
1714 struct xtsplit split; /* split information */ xtUpdate() local
1916 * split XAD into (lXAD, nXAD): xtUpdate()
1931 split.mp = mp; xtUpdate()
1932 split.index = newindex; xtUpdate()
1933 split.flag = xflag & ~XAD_NOTRECORDED; xtUpdate()
1934 split.off = nxoff; xtUpdate()
1935 split.len = nxlen; xtUpdate()
1936 split.addr = nxaddr; xtUpdate()
1937 split.pxdlist = NULL; xtUpdate()
1938 if ((rc = xtSplitUp(tid, ip, &split, &btstack))) xtUpdate()
1946 * if leaf root has been split, original root has been xtUpdate()
1995 * does nXAD force 3-way split ? xtUpdate()
2004 /* reorient nXAD as XAD for further split XAD into (nXAD, rXAD) */ xtUpdate()
2039 /* recompute split pages */ xtUpdate()
2063 * split XAD into (nXAD, rXAD) xtUpdate()
2081 printf("xtUpdate.updateLeft.split p:0x%p\n", p); xtUpdate()
2084 split.mp = mp; xtUpdate()
2085 split.index = newindex; xtUpdate()
2086 split.flag = xflag; xtUpdate()
2087 split.off = xoff; xtUpdate()
2088 split.len = xlen; xtUpdate()
2089 split.addr = xaddr; xtUpdate()
2090 split.pxdlist = NULL; xtUpdate()
2091 if ((rc = xtSplitUp(tid, ip, &split, &btstack))) xtUpdate()
2100 * if leaf root has been split, original root has been xtUpdate()
2181 struct xtsplit split; /* split information */ xtAppend() local
2224 * if the leaf page is full, split the page and xtAppend()
2225 * propagate up the router entry for the new page from split xtAppend()
2234 * allocate new index blocks to cover index page split(s) xtAppend()
2237 split.pxdlist = &pxdlist; xtAppend()
2264 split.mp = mp; xtAppend()
2265 split.index = index; xtAppend()
2266 split.flag = xflag; xtAppend()
2267 split.off = xoff; xtAppend()
2268 split.len = xlen; xtAppend()
2269 split.addr = xaddr; xtAppend()
2270 if ((rc = xtSplitUp(tid, ip, &split, &btstack))) { xtAppend()
3887 xtStat.split); jfs_xtstat_proc_show()
688 xtSplitUp(tid_t tid, struct inode *ip, struct xtsplit * split, struct btstack * btstack) xtSplitUp() argument
958 xtSplitPage(tid_t tid, struct inode *ip, struct xtsplit * split, struct metapage ** rmpp, s64 * rbnp) xtSplitPage() argument
1225 xtSplitRoot(tid_t tid, struct inode *ip, struct xtsplit * split, struct metapage ** rmpp) xtSplitRoot() argument
H A Djfs_dtree.c45 * it is extended rather than split (its size is doubled),
46 * until its length becoms 4 KBytes, from then the extent is split
76 * (e.g., if split occurs <abc> and <aBd>, <ABD> trather than <aB>
77 * should be made the router key for the split)
114 /* dtree split parameter */
153 struct dtsplit * split, struct btstack * btstack);
155 static int dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split,
159 struct dtsplit * split, struct btstack * btstack);
162 struct dtsplit * split, struct metapage ** rmpp);
614 /* init level count for max pages to split */ dtSearch()
774 /* update max. number of pages to split */ dtSearch()
829 struct dtsplit split; /* split information */ dtInsert() local
865 * extend/split the leaf page; dtInsert()
870 split.mp = mp; dtInsert()
871 split.index = index; dtInsert()
872 split.nslot = n; dtInsert()
873 split.key = name; dtInsert()
874 split.data = &data; dtInsert()
875 rc = dtSplitUp(tid, ip, &split, btstack); dtInsert()
931 struct inode *ip, struct dtsplit * split, struct btstack * btstack) dtSplitUp()
936 dtpage_t *sp; /* split page */ dtSplitUp()
938 dtpage_t *rp; /* new right page split from sp */ dtSplitUp()
949 ddata_t *data = split->data; dtSplitUp()
956 /* get split page */ dtSplitUp()
957 smp = split->mp; dtSplitUp()
968 * split leaf page dtSplitUp()
970 * The split routines insert the new entry, and dtSplitUp()
974 * split root leaf page: dtSplitUp()
984 if (n <= split->nslot) dtSplitUp()
996 split->pxdlist = &pxdlist; dtSplitUp()
997 rc = dtSplitRoot(tid, ip, split, &rmp); dtSplitUp()
1025 if ((n + sp->header.freecnt) <= split->nslot) dtSplitUp()
1045 split->pxdlist = &pxdlist; dtSplitUp()
1046 if ((rc = dtExtendPage(tid, ip, split, btstack))) { dtSplitUp()
1068 * split leaf page <sp> into <sp> and a new right page <rp>. dtSplitUp()
1074 * new index page(s) to cover page split(s) dtSplitUp()
1095 split->pxdlist = &pxdlist; dtSplitUp()
1096 if ((rc = dtSplitPage(tid, ip, split, &rmp, &rp, &rpxd))) { dtSplitUp()
1107 * propagate up the router entry for the leaf page just split dtSplitUp()
1110 * propagate the insert/split up the tree by walking back the stack dtSplitUp()
1112 * that were traversed during the search for the page that split. dtSplitUp()
1114 * the propagation of insert/split up the tree stops if the root dtSplitUp()
1115 * splits or the page inserted into doesn't have to split to hold dtSplitUp()
1118 * the parent entry for the split page remains the same, and dtSplitUp()
1147 * because the split was to the right. dtSplitUp()
1167 * if split occurs between these two entries, and dtSplitUp()
1230 * parent page is full - split the parent page dtSplitUp()
1233 /* init for parent page split */ dtSplitUp()
1234 split->mp = smp; dtSplitUp()
1235 split->index = skip; /* index at insert */ dtSplitUp()
1236 split->nslot = n; dtSplitUp()
1237 split->key = &key; dtSplitUp()
1238 /* split->data = data; */ dtSplitUp()
1243 /* The split routines insert the new entry, dtSplitUp()
1248 dtSplitRoot(tid, ip, split, &rmp) : dtSplitUp()
1249 dtSplitPage(tid, ip, split, &rmp, &rp, &rpxd); dtSplitUp()
1293 /* unpin current split and its right page */ dtSplitUp()
1298 * free remaining extents allocated for split dtSplitUp()
1328 * return split and new page pinned;
1330 static int dtSplitPage(tid_t tid, struct inode *ip, struct dtsplit * split, dtSplitPage() argument
1356 /* get split page */ dtSplitPage()
1357 smp = split->mp; dtSplitPage()
1361 * allocate the new right page for the split dtSplitPage()
1363 pxdlist = split->pxdlist; dtSplitPage()
1393 * acquire a transaction lock on the split page dtSplitPage()
1400 /* linelock header of split page */ dtSplitPage()
1434 * sequential append at tail: append without split dtSplitPage()
1440 * If we're wrong it's no big deal, we'll just do the split the right dtSplitPage()
1443 * reverse sorted data, that is, split the tree left, dtSplitPage()
1446 if (nextbn == 0 && split->index == sp->header.nextindex) { dtSplitPage()
1462 dtInsertEntry(rp, 0, split->key, split->data, &rdtlck); dtSplitPage()
1502 * split the data between the split and right pages. dtSplitPage()
1504 skip = split->index; dtSplitPage()
1509 * compute fill factor for split pages dtSplitPage()
1519 n = split->nslot; dtSplitPage()
1556 * split page moved out entries are linelocked; dtSplitPage()
1599 /* insert the new entry in the split page */ dtSplitPage()
1600 dtInsertEntry(sp, skip, split->key, split->data, &sdtlck); dtSplitPage()
1602 /* linelock stbl of split page */ dtSplitPage()
1620 dtInsertEntry(rp, skip, split->key, split->data, &rdtlck); dtSplitPage()
1643 struct inode *ip, struct dtsplit * split, struct btstack * btstack) dtExtendPage()
1668 smp = split->mp; dtExtendPage()
1680 pxdlist = split->pxdlist; dtExtendPage()
1821 dtInsertEntry(sp, split->index, split->key, split->data, &dtlck); dtExtendPage()
1861 * split the full root page into
1862 * original/root/split page and new right page
1866 * the split root page contains a single entry for the
1876 struct inode *ip, struct dtsplit * split, struct metapage ** rmpp) dtSplitRoot()
1898 /* get split root page */ dtSplitRoot()
1899 smp = split->mp; dtSplitRoot()
1905 * N.B. at first split, a one (or two) block to fit new entry dtSplitRoot()
1906 * is allocated; at subsequent split, a full page is allocated; dtSplitRoot()
1908 pxdlist = split->pxdlist; dtSplitRoot()
2013 dtInsertEntry(rp, split->index, split->key, split->data, &dtlck); dtSplitRoot()
4060 * function: move entries from split/left page to new/right page
930 dtSplitUp(tid_t tid, struct inode *ip, struct dtsplit * split, struct btstack * btstack) dtSplitUp() argument
1642 dtExtendPage(tid_t tid, struct inode *ip, struct dtsplit * split, struct btstack * btstack) dtExtendPage() argument
1875 dtSplitRoot(tid_t tid, struct inode *ip, struct dtsplit * split, struct metapage ** rmpp) dtSplitRoot() argument
H A Djfs_dmap.c2141 * to back split the dmap tree if the deallocation caused dbFreeDmap()
2228 * of the updated dmap word, dbSplit() will split dbAllocBits()
2268 * NOFREE, dbSplit() will split the binary dbAllocBits()
2482 * split or joined. the update may also cause the dmapctl's
2548 * leaf, dbSplit() will also split the binary buddy system of dbAdjCtl()
2559 * buddy system. if we are in the middle, back split dbAdjCtl()
2606 * back split the buddies. dbAdjCtl()
2653 * must be split to, specified as the log2 number of blocks.
2666 /* check if the leaf needs to be split. dbSplit()
2669 /* the split occurs by cutting the buddy system in half dbSplit()
2671 * size. pick up the starting split size (current size dbSplit()
2677 /* split until we reach the specified size. dbSplit()
2701 * FUNCTION: back split the binary buddy system of dmtree leaves
2709 * back split, with the split proceeding out from the middle of
2711 * system (more efficient). the cases in which a back split
2736 /* the back split is accomplished by iteratively finding the leaf dbBackSplit()
2753 /* back split. dbBackSplit()
2772 /* split the leaf at the start of the dbBackSplit()
/linux-4.1.27/arch/microblaze/include/asm/
H A Dflat.h23 * of the MICROBLAZE_64 reloc type. Here, a 32 bit address is split
42 /* Is it a split 64/32 reference? */ flat_get_addr_from_rp()
68 /* Is this a split 64/32 reloc? */ flat_put_addr_at_rp()
/linux-4.1.27/lib/
H A Dargv_split.c43 * argv_split - split a string at whitespace, returning an argv
45 * @str: the string to be split
48 * Returns an array of pointers to strings which are split out from
H A Ddynamic_debug.c255 pr_info("split into words:"); ddebug_tokenize()
468 char *split; ddebug_exec_queries() local
471 for (i = 0; query; query = split) { ddebug_exec_queries()
472 split = strpbrk(query, ";\n"); ddebug_exec_queries()
473 if (split) ddebug_exec_queries()
474 *split++ = '\0'; ddebug_exec_queries()
H A Dassoc_array.c52 * don't miss any leaves if the node is split up by insertion whilst assoc_array_subtree_iterate()
252 * this leaf's. Otherwise we need to split the shortcut. assoc_array_walk()
514 * need to split this node and insert in one of the fragments. assoc_array_insert_into_terminal_node()
549 /* The node has no spare slots - so we're either going to have to split assoc_array_insert_into_terminal_node()
608 pr_devel("split node\n"); assoc_array_insert_into_terminal_node()
610 /* We need to split the current node; we know that the node doesn't assoc_array_insert_into_terminal_node()
717 pr_devel("<--%s() = ok [split node]\n", __func__); assoc_array_insert_into_terminal_node()
845 /* We need to split a shortcut and insert a node between the two assoc_array_insert_mid_shortcut()
973 pr_devel("<--%s() = ok [split shortcut]\n", __func__); assoc_array_insert_mid_shortcut()
/linux-4.1.27/arch/x86/include/asm/
H A Dsparsemem.h8 * 1) we will not split memory into more chunks than will fit into the flags
H A Dperf_event.h91 } split; member in union:cpuid10_eax
104 } split; member in union:cpuid10_ebx
113 } split; member in union:cpuid10_edx
/linux-4.1.27/arch/powerpc/include/asm/
H A Dmmzone.h16 * 1) we will not split memory into more chunks than will fit into the
/linux-4.1.27/arch/cris/include/arch-v10/arch/
H A Dchecksum.h8 * to split all of those into 16-bit components, then add.
/linux-4.1.27/arch/x86/kernel/cpu/
H A Dintel_cacheinfo.c132 } split; member in union:_cpuid4_leaf_eax
141 } split; member in union:_cpuid4_leaf_ebx
148 } split; member in union:_cpuid4_leaf_ecx
278 eax->split.is_self_initializing = 1; amd_cpuid4()
279 eax->split.type = types[leaf]; amd_cpuid4()
280 eax->split.level = levels[leaf]; amd_cpuid4()
281 eax->split.num_threads_sharing = 0; amd_cpuid4()
282 eax->split.num_cores_on_die = __this_cpu_read(cpu_info.x86_max_cores) - 1; amd_cpuid4()
286 eax->split.is_fully_associative = 1; amd_cpuid4()
287 ebx->split.coherency_line_size = line_size - 1; amd_cpuid4()
288 ebx->split.ways_of_associativity = assoc - 1; amd_cpuid4()
289 ebx->split.physical_line_partition = lines_per_tag - 1; amd_cpuid4()
290 ecx->split.number_of_sets = (size_in_kb * 1024) / line_size / amd_cpuid4()
291 (ebx->split.ways_of_associativity + 1) - 1; amd_cpuid4()
604 if (eax.split.type == CTYPE_NULL) cpuid4_cache_lookup_regs()
610 this_leaf->size = (ecx.split.number_of_sets + 1) * cpuid4_cache_lookup_regs()
611 (ebx.split.coherency_line_size + 1) * cpuid4_cache_lookup_regs()
612 (ebx.split.physical_line_partition + 1) * cpuid4_cache_lookup_regs()
613 (ebx.split.ways_of_associativity + 1); cpuid4_cache_lookup_regs()
633 } while (cache_eax.split.type != CTYPE_NULL); find_num_cache_leaves()
682 switch (this_leaf.eax.split.level) { init_intel_cacheinfo()
684 if (this_leaf.eax.split.type == CTYPE_DATA) init_intel_cacheinfo()
686 else if (this_leaf.eax.split.type == CTYPE_INST) init_intel_cacheinfo()
691 num_threads_sharing = 1 + this_leaf.eax.split.num_threads_sharing; init_intel_cacheinfo()
697 num_threads_sharing = 1 + this_leaf.eax.split.num_threads_sharing; init_intel_cacheinfo()
816 nshared = base->eax.split.num_threads_sharing + 1; __cache_amd_cpumap_setup()
874 num_threads_sharing = 1 + base->eax.split.num_threads_sharing; __cache_cpumap_setup()
897 this_leaf->level = base->eax.split.level; ci_leaf_init()
898 this_leaf->type = cache_type_map[base->eax.split.type]; ci_leaf_init()
900 base->ebx.split.coherency_line_size + 1; ci_leaf_init()
902 base->ebx.split.ways_of_associativity + 1; ci_leaf_init()
904 this_leaf->number_of_sets = base->ecx.split.number_of_sets + 1; ci_leaf_init()
906 base->ebx.split.physical_line_partition + 1; ci_leaf_init()
/linux-4.1.27/tools/perf/scripts/python/
H A Dnet_dropmonitor.py25 loc = int(line.split()[0], 16)
26 name = line.split()[2]
/linux-4.1.27/scripts/
H A Dexport_report.pl14 my $no1 = (split /\s+/, $a)[1];
15 my $no2 = (split /\s+/, $b)[1];
32 my ($symbol, $no) = split /\s+/, $sym;
97 my (undef, $symbol, $module, $gpl) = split;
130 my $sym = (split /([,"])/,)[4];
H A Dcheckkconfigsymbols.py100 split = opts.diff.split("..")
101 commit_a = split[0]
102 commit_b = split[1]
242 line = line.split("#")[0] # ignore comments
H A Dshow_delta48 # split on closing bracket
49 (time_str, rest) = string.split(line[1:],']',1)
H A Dbloat-o-meter19 size, type, name = l[:-1].split()
H A Ddiffconfig44 name, val = line[7:].split("=", 1)
H A Dnamespace.pl265 ($type, $name) = (split(/ +/, $_, 3))[1..2];
348 if ($name eq (split(' ', $nmdata->[$i], 2))[1]) {
392 my ($type, $name) = split(' ', $nmdata->[$i], 2);
H A Dkernel-doc495 foreach $line (split "\n", $contents) {
1791 foreach my $arg (split ',', $members) {
1867 foreach my $arg (split($splitter, $args)) {
1893 my @args = split('\s*,\s*', $arg);
1901 push(@first_arg, split('\s+', $1));
1904 @first_arg = split('\s+', shift @args);
2001 my @sects = split ' ', $sectcheck;
2002 my @prms = split ' ', $prmscheck;
2017 # parameter list is split at spaces;
2601 ($relname, $absname) = (split())[0..1];
H A Dget_maintainer.pl179 my @words = split(" ", $line);
1182 foreach my $path (split(/:/, $ENV{PATH})) {
1194 foreach my $path (split(/:/, ".:$ENV{HOME}:.scripts")) {
1262 @lines = split("\n", $output);
1272 @lines = split("\n", $output);
1560 my @wish = split(/[, ]+/, $input);
2113 my @nw = split(/[^A-Za-zÀ-ÿ\'\,\.\+-]/, $name);
/linux-4.1.27/net/sched/
H A Dsch_cbq.c107 struct cbq_class *split; /* Ptr to split node */ member in struct:cbq_class
211 * so that it resolves to split nodes. Then packets are classified
213 * to the split node.
1058 struct cbq_class *split = cl->split; cbq_sync_defmap() local
1062 if (split == NULL) cbq_sync_defmap()
1066 if (split->defaults[i] == cl && !(cl->defmap & (1<<i))) cbq_sync_defmap()
1067 split->defaults[i] = NULL; cbq_sync_defmap()
1071 int level = split->level; cbq_sync_defmap()
1073 if (split->defaults[i]) cbq_sync_defmap()
1081 if (c->split == split && c->level < level && cbq_sync_defmap()
1083 split->defaults[i] = c; cbq_sync_defmap()
1093 struct cbq_class *split = NULL; cbq_change_defmap() local
1096 split = cl->split; cbq_change_defmap()
1097 if (!split) cbq_change_defmap()
1099 splitid = split->common.classid; cbq_change_defmap()
1102 if (split == NULL || split->common.classid != splitid) { cbq_change_defmap()
1103 for (split = cl->tparent; split; split = split->tparent) cbq_change_defmap()
1104 if (split->common.classid == splitid) cbq_change_defmap()
1108 if (split == NULL) cbq_change_defmap()
1111 if (cl->split != split) { cbq_change_defmap()
1114 cl->split = split; cbq_change_defmap()
1329 cbq_change_defmap(cl, fopt->split, fopt->defmap, fopt->defchange); cbq_set_fopt()
1489 if (cl->split || cl->defmap) { cbq_dump_fopt()
1490 opt.split = cl->split ? cl->split->common.classid : 0; cbq_dump_fopt()
/linux-4.1.27/arch/m68k/include/asm/
H A Dm52xxacr.h19 * or split instruction and data. The exception is the very old version 2
57 * a split cache configuration we allow all the combinations at Kconfig
72 /* This is the instruction cache only devices (no split cache, no eusp) */
/linux-4.1.27/fs/btrfs/
H A Dfile.c529 * [start, end]. Existing extents are split as required.
535 struct extent_map *split = NULL; btrfs_drop_extent_cache() local
555 if (!split) btrfs_drop_extent_cache()
556 split = alloc_extent_map(); btrfs_drop_extent_cache()
559 if (!split || !split2) btrfs_drop_extent_cache()
591 split->start = em->start; btrfs_drop_extent_cache()
592 split->len = start - em->start; btrfs_drop_extent_cache()
595 split->orig_start = em->orig_start; btrfs_drop_extent_cache()
596 split->block_start = em->block_start; btrfs_drop_extent_cache()
599 split->block_len = em->block_len; btrfs_drop_extent_cache()
601 split->block_len = split->len; btrfs_drop_extent_cache()
602 split->orig_block_len = max(split->block_len, btrfs_drop_extent_cache()
604 split->ram_bytes = em->ram_bytes; btrfs_drop_extent_cache()
606 split->orig_start = split->start; btrfs_drop_extent_cache()
607 split->block_len = 0; btrfs_drop_extent_cache()
608 split->block_start = em->block_start; btrfs_drop_extent_cache()
609 split->orig_block_len = 0; btrfs_drop_extent_cache()
610 split->ram_bytes = split->len; btrfs_drop_extent_cache()
613 split->generation = gen; btrfs_drop_extent_cache()
614 split->bdev = em->bdev; btrfs_drop_extent_cache()
615 split->flags = flags; btrfs_drop_extent_cache()
616 split->compress_type = em->compress_type; btrfs_drop_extent_cache()
617 replace_extent_mapping(em_tree, em, split, modified); btrfs_drop_extent_cache()
618 free_extent_map(split); btrfs_drop_extent_cache()
619 split = split2; btrfs_drop_extent_cache()
625 split->start = start + len; btrfs_drop_extent_cache()
626 split->len = em->start + em->len - (start + len); btrfs_drop_extent_cache()
627 split->bdev = em->bdev; btrfs_drop_extent_cache()
628 split->flags = flags; btrfs_drop_extent_cache()
629 split->compress_type = em->compress_type; btrfs_drop_extent_cache()
630 split->generation = gen; btrfs_drop_extent_cache()
633 split->orig_block_len = max(em->block_len, btrfs_drop_extent_cache()
636 split->ram_bytes = em->ram_bytes; btrfs_drop_extent_cache()
638 split->block_len = em->block_len; btrfs_drop_extent_cache()
639 split->block_start = em->block_start; btrfs_drop_extent_cache()
640 split->orig_start = em->orig_start; btrfs_drop_extent_cache()
642 split->block_len = split->len; btrfs_drop_extent_cache()
643 split->block_start = em->block_start btrfs_drop_extent_cache()
645 split->orig_start = em->orig_start; btrfs_drop_extent_cache()
648 split->ram_bytes = split->len; btrfs_drop_extent_cache()
649 split->orig_start = split->start; btrfs_drop_extent_cache()
650 split->block_len = 0; btrfs_drop_extent_cache()
651 split->block_start = em->block_start; btrfs_drop_extent_cache()
652 split->orig_block_len = 0; btrfs_drop_extent_cache()
656 replace_extent_mapping(em_tree, em, split, btrfs_drop_extent_cache()
659 ret = add_extent_mapping(em_tree, split, btrfs_drop_extent_cache()
663 free_extent_map(split); btrfs_drop_extent_cache()
664 split = NULL; btrfs_drop_extent_cache()
676 if (split) btrfs_drop_extent_cache()
677 free_extent_map(split); btrfs_drop_extent_cache()
688 * it is either truncated or split. Anything entirely inside the range
1070 * part of extent is marked as written, the extent will be split into
1088 u64 split; btrfs_mark_extent_written() local
1100 split = start; btrfs_mark_extent_written()
1103 key.offset = split; btrfs_mark_extent_written()
1184 split = end; btrfs_mark_extent_written()
1186 new_key.offset = split; btrfs_mark_extent_written()
1202 split - key.offset); btrfs_mark_extent_written()
1208 btrfs_set_file_extent_offset(leaf, fi, split - orig_offset); btrfs_mark_extent_written()
1210 extent_end - split); btrfs_mark_extent_written()
1218 if (split == start) { btrfs_mark_extent_written()
H A Dctree.c2094 /* Node balancing for insertion. Here we only split or push nodes around
2660 * if ins_len > 0, nodes and leaves will be split as we walk down the
3434 * split the node at the specified level in path in two.
3435 * The path is corrected to point to the appropriate node after the split
3447 struct extent_buffer *split; split_node() local
3457 * trying to split the root, lets make a new one split_node()
3483 split = btrfs_alloc_tree_block(trans, root, 0, root->root_key.objectid, split_node()
3485 if (IS_ERR(split)) split_node()
3486 return PTR_ERR(split); split_node()
3490 memset_extent_buffer(split, 0, 0, sizeof(struct btrfs_header)); split_node()
3491 btrfs_set_header_level(split, btrfs_header_level(c)); split_node()
3492 btrfs_set_header_bytenr(split, split->start); split_node()
3493 btrfs_set_header_generation(split, trans->transid); split_node()
3494 btrfs_set_header_backref_rev(split, BTRFS_MIXED_BACKREF_REV); split_node()
3495 btrfs_set_header_owner(split, root->root_key.objectid); split_node()
3496 write_extent_buffer(split, root->fs_info->fsid, split_node()
3498 write_extent_buffer(split, root->fs_info->chunk_tree_uuid, split_node()
3499 btrfs_header_chunk_tree_uuid(split), split_node()
3502 ret = tree_mod_log_eb_copy(root->fs_info, split, c, 0, split_node()
3508 copy_extent_buffer(split, c, split_node()
3512 btrfs_set_header_nritems(split, c_nritems - mid); split_node()
3517 btrfs_mark_buffer_dirty(split); split_node()
3519 insert_ptr(trans, root, path, &disk_key, split->start, split_node()
3526 path->nodes[level] = split; split_node()
3529 btrfs_tree_unlock(split); split_node()
3530 free_extent_buffer(split); split_node()
4027 * split the path's leaf in two, making sure there is at least data_size
4095 * of a leaf. A double split can leave us with 3 mostly empty leaves:
4100 * into the adjacent leaves. If all goes well we can avoid the double split
4155 * split the path's leaf in two, making sure there is at least data_size
4175 int split; split_leaf() local
4215 split = 1; split_leaf()
4226 split = 0; split_leaf()
4234 split = 2; split_leaf()
4242 split = 0; split_leaf()
4252 split = 2; split_leaf()
4258 if (split == 0) split_leaf()
4283 if (split == 0) { split_leaf()
4310 if (split == 2) { split_leaf()
4470 * the split, the path is pointing to the old item. The
4473 * Note, the item being split must be smaller enough to live alone on
4476 * This allows us to split the item in place, keeping a lock on the
4500 * This allows us to split file extent in place, keeping a lock on the
H A Dextent_io.c455 u64 split) split_cb()
458 tree->ops->split_extent_hook(tree->mapping->host, orig, split); split_cb()
462 * split a given extent state struct in two, inserting the preallocated
463 * struct 'prealloc' as the newly created second half. 'split' indicates an
464 * offset inside 'orig' where it should be split.
469 * prealloc: [orig->start, split - 1]
470 * orig: [ split, orig->end ]
476 struct extent_state *prealloc, u64 split) split_state()
480 split_cb(tree, orig, split); split_state()
483 prealloc->end = split - 1; split_state()
485 orig->start = split; split_state()
652 * We need to split the extent we found, and may flip clear_extent_bit()
656 * just split and search again. It'll get split again clear_extent_bit()
682 * We need to split the extent, and clear the bit clear_extent_bit()
921 * We need to split the extent we found, and may flip bits on __set_extent_bit()
925 * range, we just split and search again. It'll get split __set_extent_bit()
995 * We need to split the extent, and set the bit __set_extent_bit()
1151 * We need to split the extent we found, and may flip bits on convert_extent_bit()
1155 * range, we just split and search again. It'll get split convert_extent_bit()
1222 * We need to split the extent, and set the bit convert_extent_bit()
454 split_cb(struct extent_io_tree *tree, struct extent_state *orig, u64 split) split_cb() argument
475 split_state(struct extent_io_tree *tree, struct extent_state *orig, struct extent_state *prealloc, u64 split) split_state() argument
/linux-4.1.27/drivers/s390/crypto/
H A Dzcrypt_pcixcc.h9 * Major cleanup & driver split: Martin Schwidefsky <schwidefsky@de.ibm.com>
H A Dzcrypt_msgtype50.h9 * Major cleanup & driver split: Martin Schwidefsky <schwidefsky@de.ibm.com>
H A Dzcrypt_pcica.h9 * Major cleanup & driver split: Martin Schwidefsky <schwidefsky@de.ibm.com>
H A Dzcrypt_api.h10 * Major cleanup & driver split: Martin Schwidefsky <schwidefsky@de.ibm.com>
H A Dzcrypt_cex2a.c9 * Major cleanup & driver split: Martin Schwidefsky <schwidefsky@de.ibm.com>
H A Dzcrypt_cex2a.h9 * Major cleanup & driver split: Martin Schwidefsky <schwidefsky@de.ibm.com>
H A Dzcrypt_error.h9 * Major cleanup & driver split: Martin Schwidefsky <schwidefsky@de.ibm.com>
H A Dzcrypt_msgtype6.h9 * Major cleanup & driver split: Martin Schwidefsky <schwidefsky@de.ibm.com>
/linux-4.1.27/drivers/gpu/drm/radeon/
H A Ddrm_buffer.c144 * Read an object from buffer that may be split to multiple parts. If object
145 * is not split function just returns the pointer to object in buffer. But in
146 * case of split object data is copied to given stack object that is suplied
165 /* The object is split which forces copy to temporary object.*/ drm_buffer_read_object()
H A Ddrm_buffer.h101 * Read an object from buffer that may be split to multiple parts. If object
102 * is not split function just returns the pointer to object in buffer. But in
103 * case of split object data is copied to given stack object that is suplied
119 * Caller must make sure that dword is not split in the buffer. This
/linux-4.1.27/include/uapi/linux/netfilter/
H A Dnfnetlink.h39 /* netfilter netlink message types are split in two pieces:
/linux-4.1.27/tools/perf/util/
H A Dalias.c33 /* split alias_string */
H A Dsetup.py21 cflags = getenv('CFLAGS', '').split()
H A Dpager.c6 * This is split up from the rest of git so that we can do
H A Dstring.c107 * argv_split - split a string at whitespace, returning an argv
108 * @str: the string to be split
111 * Returns an array of pointers to strings which are split out from
H A Dcgroup.c23 * in order to handle split hierarchy, we need to scan /proc/mounts cgroupfs_find_mountpoint()
/linux-4.1.27/drivers/crypto/caam/
H A Dkey_gen.c31 get a split ipad/opad key
87 * FIFO_STORE with the explicit split-key content store gen_split_key()
/linux-4.1.27/fs/nfs/blocklayout/
H A Dextent_tree.c286 struct pnfs_block_extent *split; ext_tree_insert() local
290 split = kmemdup(new, sizeof(*new), GFP_ATOMIC); ext_tree_insert()
291 if (!split) { ext_tree_insert()
296 split->be_length = be->be_f_offset - split->be_f_offset; ext_tree_insert()
297 split->be_device = nfs4_get_deviceid(new->be_device); ext_tree_insert()
298 __ext_tree_insert(root, split, true); ext_tree_insert()
368 sector_t split) ext_tree_split()
377 be->be_length = split - be->be_f_offset; ext_tree_split()
379 new->be_f_offset = split; ext_tree_split()
367 ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be, sector_t split) ext_tree_split() argument
/linux-4.1.27/drivers/net/arcnet/
H A Drfc1201.c166 if (!soft->split_flag) { /* not split */ rx()
167 BUGMSG(D_RX, "incoming is not split (splitflag=%d)\n", rx()
233 } else { /* split packet */ rx()
251 BUGMSG(D_RX, "packet is split (splitflag=%d, seq=%d)\n", rx()
264 if (soft->split_flag & 1) { /* first packet in split */ rx()
291 BUGMSG(D_NORMAL, "(split) memory squeeze, dropping packet.\n"); rx()
303 soft->split_flag = 0; /* end result won't be split */ rx()
313 BUGMSG(D_EXTRA, "can't continue split without starting " rx()
362 BUGMSG(D_SKB_SIZE, "skb: received %d bytes from %02X (split)\n", rx()
422 soft->split_flag = 0; /* split packets are done elsewhere */ build_header()
488 /* need to do a split packet? */ prepare_tx()
497 BUGMSG(D_DURING, "rfc1201 prep_tx: ready for %d-segment split " prepare_tx()
/linux-4.1.27/arch/metag/include/uapi/asm/
H A Dptrace.h18 /* SCC bit (indicates split 16x16 condition flags) */
36 /* split 16x16 condition flags */
/linux-4.1.27/sound/usb/usx2y/
H A Dusb_stream.c561 unsigned split = s->inpacket_head; stream_start() local
563 while (l > s->inpacket[split].length) { stream_start()
564 l -= s->inpacket[split].length; stream_start()
565 if (split == 0) stream_start()
566 split = s->inpackets - 1; stream_start()
568 split--; stream_start()
570 s->next_inpacket_split = split; stream_start()
572 s->inpacket[split].length - l; stream_start()
/linux-4.1.27/drivers/media/pci/ivtv/
H A Divtv-udma.h27 void ivtv_udma_fill_sg_array(struct ivtv_user_dma *dma, u32 buffer_offset, u32 buffer_offset_2, u32 split);
H A Divtv-udma.c75 void ivtv_udma_fill_sg_array (struct ivtv_user_dma *dma, u32 buffer_offset, u32 buffer_offset_2, u32 split) { ivtv_udma_fill_sg_array() argument
85 split -= sg_dma_len(sg); ivtv_udma_fill_sg_array()
86 if (split == 0) ivtv_udma_fill_sg_array()
/linux-4.1.27/arch/sparc/include/asm/
H A Dviking.h36 * on chip split I/D caches of the GNU/Viking.
42 * to work at all. On non-mxcc GNU/Viking modules the split I/D
55 * in boot mode instruction accesses bypass the split on chip I/D
76 * These bits enable the on-cpu GNU/Viking split I/D caches. Note,
H A Dturbosparc.h27 * These bits enable the on-cpu TurboSparc split I/D caches.
/linux-4.1.27/arch/metag/mm/
H A Dmaccess.c11 * The generic probe_kernel_write() uses the user copy code which can split the
/linux-4.1.27/net/ipv4/
H A Dfib_rules.c177 /* split local/main if they are not already split */ fib4_rule_configure()
229 /* split local/main if they are not already split */ fib4_rule_delete()
/linux-4.1.27/scripts/gdb/linux/
H A Ddmesg.py27 log_buf_addr = int(str(gdb.parse_and_eval("log_buf")).split()[0], 16)
H A Dsymbols.py112 module_addr = str(module['module_core']).split()[0]
157 self.module_paths = arg.split()
H A Dmodules.py77 address=str(module['module_core']).split()[0],
H A Dutils.py47 return int(str(element[field].address).split()[0], 16)
/linux-4.1.27/drivers/firewire/
H A Dnosy.c173 size_t split = end - buffer->head->data; packet_buffer_get() local
175 if (copy_to_user(data, buffer->head->data, split)) packet_buffer_get()
177 if (copy_to_user(data + split, buffer->data, length - split)) packet_buffer_get()
179 buffer->head = (struct packet *) &buffer->data[length - split]; packet_buffer_get()
212 size_t split = end - buffer->tail->data; packet_buffer_put() local
214 memcpy(buffer->tail->data, data, split); packet_buffer_put()
215 memcpy(buffer->data, data + split, length - split); packet_buffer_put()
216 buffer->tail = (struct packet *) &buffer->data[length - split]; packet_buffer_put()
/linux-4.1.27/drivers/media/dvb-frontends/
H A Ddib7000m.c638 if(!state->current_agc || !state->current_agc->perform_agc_softsplit || state->current_agc->split.max == 0) dib7000m_agc_soft_split()
644 if (agc > state->current_agc->split.min_thres) dib7000m_agc_soft_split()
645 split_offset = state->current_agc->split.min; dib7000m_agc_soft_split()
646 else if (agc < state->current_agc->split.max_thres) dib7000m_agc_soft_split()
647 split_offset = state->current_agc->split.max; dib7000m_agc_soft_split()
649 split_offset = state->current_agc->split.max * dib7000m_agc_soft_split()
650 (agc - state->current_agc->split.min_thres) / dib7000m_agc_soft_split()
651 (state->current_agc->split.max_thres - state->current_agc->split.min_thres); dib7000m_agc_soft_split()
778 dib7000m_write_word(state, 103, 1 << 8); /* force 0 split on WBD and restart AGC */ dib7000m_agc_startup()
791 case 2: /* fast split search path after 5sec */ dib7000m_agc_startup()
793 dib7000m_write_word(state, 103, 2 << 9); /* fast split search 0.25kHz */ dib7000m_agc_startup()
798 case 3: /* split search ended */ dib7000m_agc_startup()
799 agc_split = (u8)dib7000m_read_word(state, 392); /* store the split value for the next time */ dib7000m_agc_startup()
803 dib7000m_write_word(state, 103, (state->current_agc->wbd_alpha << 9) | agc_split); /* standard split search */ dib7000m_agc_startup()
H A Ddibx000_common.h113 } split; member in struct:dibx000_agc_config
/linux-4.1.27/arch/x86/kernel/
H A Dcrash.c41 /* This primarily represents number of split ranges due to exclusion */
230 * If we have gart region, excluding that could potentially split fill_up_crash_elf_data()
236 /* Exclusion of crash region could split memory ranges */ fill_up_crash_elf_data()
239 /* If crashk_low_res is not 0, another range split possible */ fill_up_crash_elf_data()
293 /* If a split happend, add the split to array */ exclude_mem_range()
299 pr_err("Too many crash ranges after split\n"); exclude_mem_range()
319 * might lead to split and split ranges are put in ced->mem.ranges[] array
/linux-4.1.27/arch/x86/kvm/
H A Dpmu.c483 pmu->version = eax.split.version_id; kvm_pmu_cpuid_update()
487 pmu->nr_arch_gp_counters = min_t(int, eax.split.num_counters, kvm_pmu_cpuid_update()
489 pmu->counter_bitmask[KVM_PMC_GP] = ((u64)1 << eax.split.bit_width) - 1; kvm_pmu_cpuid_update()
491 ((1ull << eax.split.mask_length) - 1); kvm_pmu_cpuid_update()
497 min_t(int, edx.split.num_counters_fixed, kvm_pmu_cpuid_update()
500 ((u64)1 << edx.split.bit_width_fixed) - 1; kvm_pmu_cpuid_update()
H A Dcpuid.c449 eax.split.version_id = min(cap.version, 2); __do_cpuid_ent()
450 eax.split.num_counters = cap.num_counters_gp; __do_cpuid_ent()
451 eax.split.bit_width = cap.bit_width_gp; __do_cpuid_ent()
452 eax.split.mask_length = cap.events_mask_len; __do_cpuid_ent()
454 edx.split.num_counters_fixed = cap.num_counters_fixed; __do_cpuid_ent()
455 edx.split.bit_width_fixed = cap.bit_width_fixed; __do_cpuid_ent()
456 edx.split.reserved = 0; __do_cpuid_ent()
/linux-4.1.27/arch/alpha/lib/
H A Dev6-csum_ipv6_magic.S38 * Finally, original 'folding' approach is to split the long into 4 unsigned shorts
45 * split into 2 uints, add those, generating a ulong
/linux-4.1.27/arch/arc/include/asm/
H A Dpgalloc.h14 * So calculate it based on addr traversal split [pgd-bits:pte-bits:xxx]
81 * With software-only page-tables, addr-split for traversal is tweakable and
/linux-4.1.27/scripts/rt-tester/
H A Drt-tester.py141 parts = line.split(":")
179 stat = status.split(",")
/linux-4.1.27/sound/aoa/soundbus/
H A Dcore.c86 * it's not really legal to split it out with commas. We split it soundbus_uevent()
/linux-4.1.27/drivers/staging/comedi/drivers/
H A Ddas08_pci.c29 * This is the PCI-specific support split off from the das08 driver.
H A Ddas08_cs.c33 This is the PCMCIA-specific support split off from the
H A Dni_labpc_pci.c24 * This is the PCI-specific support split off from the ni_labpc driver.
H A Ddas08_isa.c34 * This is the ISA/PC-104-specific support split off from the das08 driver.
/linux-4.1.27/drivers/net/xen-netback/
H A Dcommon.h136 /* When feature-split-event-channels = 0, tx_irq = rx_irq. */
138 /* Only used when feature-split-event-channels = 1 */
173 /* When feature-split-event-channels = 0, tx_irq = rx_irq. */
175 /* Only used when feature-split-event-channels = 1 */
/linux-4.1.27/arch/sh/mm/
H A Dtlb-pteaex.c65 * data arrays, SH-X3 cores with PTEAEX split out the memory-mapped
/linux-4.1.27/drivers/gpu/drm/msm/
H A Dmsm_kms.h29 * snapdragon version, the kms support is split out and the appropriate
/linux-4.1.27/arch/powerpc/platforms/cell/
H A Dinterrupt.h12 * The bottom 8 bits are split into 2 type bits and 6 data bits that
/linux-4.1.27/Documentation/arm/Samsung/
H A Dclksrc-change-registers.awk24 r = split(l, tp)
/linux-4.1.27/net/caif/
H A Dcfpkt_skbuff.c345 u8 *split = skb->data + pos; cfpkt_split() local
346 u16 len2nd = skb_tail_pointer(skb) - split; cfpkt_split()
352 PKT_ERROR(pkt, "trying to split beyond end of packet\n"); cfpkt_split()
371 memcpy(skb2->data, split, len2nd); cfpkt_split()
/linux-4.1.27/drivers/net/ethernet/intel/i40evf/
H A Di40evf.h86 #define I40EVF_RXBUFFER_64 64 /* Used for packet split */
87 #define I40EVF_RXBUFFER_128 128 /* Used for packet split */
88 #define I40EVF_RXBUFFER_256 256 /* Used for packet split */
/linux-4.1.27/include/net/caif/
H A Dcfpkt.h153 * cfpkt_split - Split a packet into two packets at the specified split point.
154 * pkt: Packet to be split (will contain the first part of the data on exit)
155 * pos: Position to split packet in two parts.
/linux-4.1.27/drivers/usb/host/
H A Doxu210hp.h218 #define QTD_STS_MMF (1 << 2) /* incomplete split transaction */
219 #define QTD_STS_STS (1 << 1) /* split transaction state */
316 u8 gap_uf; /* uframes split/csplit gap */
317 u8 c_usecs; /* ... split completion bw */
429 struct oxu_murb *murb_pool; /* murb per split big urb */
H A Dehci.h208 struct dma_pool *sitd_pool; /* sitd per split iso urb */
310 #define QTD_STS_MMF (1 << 2) /* incomplete split transaction */
311 #define QTD_STS_STS (1 << 1) /* split transaction state */
434 u8 gap_uf; /* uframes split/csplit gap */
542 * siTD, aka split-transaction isochronous Transfer Descriptor
561 #define SITD_STS_MMF (1 << 2) /* incomplete split transaction */
562 #define SITD_STS_STS (1 << 1) /* split transaction state */
587 * Manages split interrupt transactions (using TT) that span frame boundaries
605 * Scheduling and budgeting split transactions using TTs
H A Dfotg210.h325 #define QTD_STS_MMF (1 << 2) /* incomplete split transaction */
326 #define QTD_STS_STS (1 << 1) /* split transaction state */
452 u8 gap_uf; /* uframes split/csplit gap */
453 u8 c_usecs; /* ... split completion bw */
569 * Manages split interrupt transactions (using TT) that span frame boundaries
H A Dfusbh200.h317 #define QTD_STS_MMF (1 << 2) /* incomplete split transaction */
318 #define QTD_STS_STS (1 << 1) /* split transaction state */
442 u8 gap_uf; /* uframes split/csplit gap */
443 u8 c_usecs; /* ... split completion bw */
559 * Manages split interrupt transactions (using TT) that span frame boundaries
/linux-4.1.27/mm/
H A Dmremap.c246 int split = 0; move_vma() local
252 * which may split one vma into three before unmapping. move_vma()
304 split = 1; move_vma()
320 /* OOM: unable to split vma, just get accounts right */ move_vma()
329 if (split) move_vma()
H A Dswap.c99 * not be split by __split_huge_page_refcount().
156 * @page was a THP tail. The split @page_head put_unrefcounted_compound_page()
191 * split THP tail and page_head was put_refcounted_compound_page()
192 * the THP head before the split. put_refcounted_compound_page()
260 * 3. a split THP page. put_compound_page()
315 * tail. The split page_head has been __get_page_tail()
H A Dhuge_memory.c871 * under splitting since we don't split the page itself, only pmd to copy_huge_pmd()
891 /* split huge page running from under us */ copy_huge_pmd()
945 * the source page gets split and a tail freed before copy completes.
1620 * to split it, the pmd must remain marked huge at all __split_huge_page_splitting()
1699 * for this code to be safe, the split the mapcount __split_huge_page_refcount()
1738 * of the tail pages after the split is complete. __split_huge_page_refcount()
1794 * during the split (which happens in place). If we __split_huge_page_map()
1813 * split is complete for this pmd), then we flush the __split_huge_page_map()
1882 * Return 0 if the hugepage is split successfully otherwise return 1.
1897 * against parallel split or collapse operations. split_huge_page_to_list()
2973 * previously contain an hugepage: check if we need to split __vma_adjust_trans_huge()
2983 * previously contain an hugepage: check if we need to split __vma_adjust_trans_huge()
2994 * contain an hugepage: check if we need to split an huge pmd. __vma_adjust_trans_huge()
/linux-4.1.27/fs/ext4/
H A Dextents.c51 #define EXT4_EXT_MAY_ZEROOUT 0x1 /* safe to zeroout if split fails \
107 ext4_lblk_t split,
797 * we get such a leaf in split/add case ext4_ext_binsearch()
1017 * - makes decision where to split
1018 * - moves remaining extents and index entries (right to the split point)
1037 /* make decision: where to split? */ ext4_ext_split()
1040 /* if current leaf will be split, then we should use ext4_ext_split()
1041 * border from split point */ ext4_ext_split()
1048 ext_debug("leaf will be split." ext4_ext_split()
1397 * in all other cases we have to split the grown tree ext4_ext_create_new_leaf()
1401 /* now we need to split */ ext4_ext_create_new_leaf()
2441 * index/leaf need to be changed in case of the tree split.
2443 * If more extents are inserted, they could cause the whole tree split more
2820 * so we have to check whether we need to split the extent covering ext4_ext_remove_space()
2852 * See if the last block is inside the extent, if so split ext4_ext_remove_space()
2854 * tail of the first part of the split extent in ext4_ext_remove_space()
2860 * If we're going to split the extent, note that ext4_ext_remove_space()
3141 * @split: the logical block where the extent is splitted.
3142 * @split_flags: indicates if the extent could be zeroout if split fails, and
3147 * Splits extent [a, b] into two extents [a, @split) and [@split, b], states
3152 * b> split is not needed, and just mark the extent.
3159 ext4_lblk_t split, ext4_split_extent_at()
3175 "block %llu\n", inode->i_ino, (unsigned long long)split); ext4_split_extent_at()
3183 newblock = split - ee_block + ext4_ext_pblock(ex); ext4_split_extent_at()
3185 BUG_ON(split < ee_block || split >= (ee_block + ee_len)); ext4_split_extent_at()
3195 if (split == ee_block) { ext4_split_extent_at()
3197 * case b: block @split is the block that the extent begins with ext4_split_extent_at()
3215 ex->ee_len = cpu_to_le16(split - ee_block); ext4_split_extent_at()
3228 ex2->ee_block = cpu_to_le32(split); ext4_split_extent_at()
3229 ex2->ee_len = cpu_to_le16(ee_len - (split - ee_block)); ext4_split_extent_at()
3293 * a> There is no split required
3337 * result in split of original leaf or extent zeroout. ext4_split_extent()
3376 * a> There is no split required: Entire extent should be initialized
3580 * 1. split the extent into three extents. ext4_ext_convert_to_initialized()
3581 * 2. split the extent into two extents, zeroout the first half. ext4_ext_convert_to_initialized()
3582 * 3. split the extent into two extents, zeroout the second half. ext4_ext_convert_to_initialized()
3583 * 4. split the extent into two extents with out zeroout. ext4_ext_convert_to_initialized()
3639 * a> There is no split required: Entire extent should be unwritten
3646 * the unwritten extent split. To prevent ENOSPC occur at the IO
3647 * complete, we need to split the unwritten extent before DIO submit
3648 * the IO. The unwritten extent called at this time will be split
4030 /* get_block() before submit the IO, split the extent */ ext4_ext_handle_unwritten_extents()
4323 * we split out initialized portions during a write. ext4_ext_map_blocks()
4674 * that it doesn't get unnecessarily split into multiple ext4_alloc_file_blocks()
5575 int split = 0; ext4_swap_extents() local
5632 split = 1; ext4_swap_extents()
5639 split = 1; ext4_swap_extents()
5645 /* ext4_split_extent_at() may result in leaf extent split, ext4_swap_extents()
5647 if (split) ext4_swap_extents()
5658 split = 1; ext4_swap_extents()
5665 split = 1; ext4_swap_extents()
5671 /* ext4_split_extent_at() may result in leaf extent split, ext4_swap_extents()
5673 if (split) ext4_swap_extents()
3156 ext4_split_extent_at(handle_t *handle, struct inode *inode, struct ext4_ext_path **ppath, ext4_lblk_t split, int split_flag, int flags) ext4_split_extent_at() argument
/linux-4.1.27/fs/ceph/
H A Dsnap.c811 u64 split; ceph_handle_snap() local
828 split = le64_to_cpu(h->split); /* non-zero if we are splitting an ceph_handle_snap()
835 dout("handle_snap from mds%d op %s split %llx tracelen %d\n", mds, ceph_handle_snap()
836 ceph_snap_op_name(op), split, trace_len); ceph_handle_snap()
849 * A "split" breaks part of an existing realm off into ceph_handle_snap()
864 realm = ceph_lookup_snap_realm(mdsc, split); ceph_handle_snap()
866 realm = ceph_create_snap_realm(mdsc, split); ceph_handle_snap()
891 * a race (due to another split notifications ceph_handle_snap()
902 dout(" will move %p to split realm %llx %p\n", ceph_handle_snap()
H A Dstrings.c122 case CEPH_SNAP_OP_SPLIT: return "split"; ceph_snap_op_name()
/linux-4.1.27/drivers/usb/dwc2/
H A Dhcd_queue.c101 /* Todo: Account for split transfers in the bus time */ dwc2_qh_init()
640 * Schedule the next continuing periodic split transfer
653 * Allow one frame to elapse after start split dwc2_sched_periodic_split()
654 * microframe before scheduling complete split, but dwc2_sched_periodic_split()
655 * DON'T if we are doing the next start split in the dwc2_sched_periodic_split()
752 /* Start split */ dwc2_hcd_qtd_init()
H A Dhcd.h92 * @do_split: Enable split for the channel
93 * @complete_split: Enable complete split
94 * @hub_addr: Address of high speed hub for the split
95 * @hub_port: Port of the low/full speed device for the split
234 * @do_split: Full/low speed endpoint on high-speed hub requires split
242 * @start_split_frame: (Micro)frame at which last start split was initialized
302 * @complete_split: Keeps track of the current split type for FS/LS
304 * @isoc_split_pos: Position of the ISOC split in full/low speed
311 * @isoc_split_offset: Position of the ISOC split in the buffer for the
/linux-4.1.27/Documentation/trace/postprocess/
H A Dtrace-vmscan-postprocess.pl168 foreach $tuple (split /\s/, $regex) {
169 my ($key, $value) = split(/=/, $tuple);
262 my ($sec, $usec) = split (/\./, $timestamp);
496 my ($dummy, $latency) = split(/-/, $stats{$process_pid}->{HIGH_DIRECT_RECLAIM_LATENCY}[$index]);
500 my ($dummy, $latency) = split(/-/, $stats{$process_pid}->{HIGH_KSWAPD_LATENCY}[$index]);
535 my ($dummy, $latency) = split(/-/, $stats{$process_pid}->{HIGH_DIRECT_RECLAIM_LATENCY}[$index]);
H A Dtrace-pagealloc-postprocess.pl114 foreach $tuple (split /\s/, $regex) {
115 my ($key, $value) = split(/=/, $tuple);
/linux-4.1.27/drivers/gpu/drm/panel/
H A Dpanel-sharp-lq101r1sx01.c227 * TODO: The device supports both left-right and even-odd split sharp_panel_prepare()
229 * right split. To support a different mode a mechanism needs to be sharp_panel_prepare()
236 dev_err(panel->dev, "failed to set up symmetrical split: %d\n", sharp_panel_prepare()
/linux-4.1.27/include/xen/interface/io/
H A Dnetif.h42 * "feature-split-event-channels" is introduced to separate guest TX
64 * "feature-split-event-channels" may optionally be used when using
79 * are indexed from zero. For example, a frontend with two queues and split
/linux-4.1.27/drivers/ide/
H A Dide-generic.c5 * This code was split off from ide.c. See it for original copyrights.
/linux-4.1.27/drivers/mtd/maps/
H A Dcfi_flagadm.c35 /* We split the flash chip up into four parts.
H A Dnetsc520.c52 /* partition_info gives details on the logical partitions that the split the
/linux-4.1.27/drivers/net/ethernet/intel/igbvf/
H A Ddefines.h57 /* Same mask, but for extended and packet split descriptors */
/linux-4.1.27/drivers/media/usb/usbtv/
H A Dusbtv-core.c67 /* Packet size is split into 11 bits of base size and count of usbtv_probe()
/linux-4.1.27/arch/x86/um/os-Linux/
H A Dtask_size.c118 /* This could happen with a 4G/4G split */ os_get_top_address()
/linux-4.1.27/drivers/clk/mvebu/
H A Darmada-xp.c24 * Armada XP Sample At Reset is a 64 bit bitfiled split in two
/linux-4.1.27/arch/mips/include/asm/
H A Dcpu-info.h64 struct cache_desc tcache; /* Tertiary/split secondary cache */
/linux-4.1.27/drivers/ata/
H A Dpata_piccolo.c5 * then split out to keep ata_generic "clean".
/linux-4.1.27/include/net/
H A Dudplite.h90 * (ii) Payload too big for send buffer: data is split udplite_csum_outgoing()
/linux-4.1.27/include/uapi/linux/
H A Dblktrace_api.h50 __BLK_TA_SPLIT, /* bio was split */
H A Dif_arcnet.h61 __u8 split_flag; /* for use with split packets */
/linux-4.1.27/include/linux/
H A Drwlock.h11 * split out from spinlock.h
H A Dcpu_pm.h34 * The notifications are split into two classes: CPU notifications and CPU
/linux-4.1.27/arch/sh/include/asm/
H A Dspinlock.h16 * split this out as per atomic-*.h.
/linux-4.1.27/arch/sh/kernel/cpu/
H A Dproc.c114 seq_printf(m, "split (harvard)\n"); show_cpuinfo()
/linux-4.1.27/arch/powerpc/perf/
H A De500-pmu.c40 * D-cache misses are not split into read/write/prefetch;
/linux-4.1.27/arch/ia64/include/asm/
H A Dpci.h17 __u32 pci_id; /* ACPI split 16 bits device, 16 bits function (see section 6.1.1) */
/linux-4.1.27/arch/ia64/mm/
H A Dnuma.c7 * be split away from DISCONTIGMEM and are used on NUMA machines with
/linux-4.1.27/arch/arm/mach-s3c24xx/
H A Dvr1000.h61 * 0xE0000000 contains the IO space that is split by speed and
H A Dbast.h129 * 0xE0000000 contains the IO space that is split by speed and
/linux-4.1.27/arch/arm/mm/
H A Dtlb-v6.S11 * These assume a split I/D TLB.
H A Dfault-armv.c38 * without CONFIG_CPU_CACHE_VIPT) cannot support split page_table_lock.
70 * If we are using split PTE locks, then we need to take the page
H A Dproc-v7-2level.S38 * - we are not using split page tables
H A Dproc-v7-3level.S140 * Only use split TTBRs if PHYS_OFFSET <= PAGE_OFFSET (cmp above),
/linux-4.1.27/arch/arm/include/asm/
H A Dpgtable-3level-hwdef.h89 * TTBR0/TTBR1 split (PAGE_OFFSET):
/linux-4.1.27/net/wireless/
H A Dgenregdb.awk90 split(flagstr, flagarray, ",")
/linux-4.1.27/sound/pci/hda/
H A Dhda_auto_parser.h84 #define HDA_PINCFG_NO_HP_FIXUP (1 << 0) /* no HP-split */
/linux-4.1.27/tools/testing/selftests/vm/
H A Dtranshuge-stress.c132 /* split transhuge page, keep last page */ main()
/linux-4.1.27/arch/mips/mm/
H A Dtlbex.c1370 u32 *split; build_r4000_tlb_refill_handler() local
1377 split = labels[i].addr; build_r4000_tlb_refill_handler()
1382 if (split > tlb_handler + MIPS64_REFILL_INSNS || build_r4000_tlb_refill_handler()
1383 split < p - MIPS64_REFILL_INSNS) build_r4000_tlb_refill_handler()
1392 split = tlb_handler + MIPS64_REFILL_INSNS - 2; build_r4000_tlb_refill_handler()
1399 if (uasm_insn_has_bdelay(relocs, split - 1)) build_r4000_tlb_refill_handler()
1400 split--; build_r4000_tlb_refill_handler()
1403 uasm_copy_handler(relocs, labels, tlb_handler, split, f); build_r4000_tlb_refill_handler()
1404 f += split - tlb_handler; build_r4000_tlb_refill_handler()
1410 if (uasm_insn_has_bdelay(relocs, split)) build_r4000_tlb_refill_handler()
1414 split, split + 1, f); build_r4000_tlb_refill_handler()
1417 split++; build_r4000_tlb_refill_handler()
1422 uasm_copy_handler(relocs, labels, split, p, final_handler); build_r4000_tlb_refill_handler()
1424 (p - split); build_r4000_tlb_refill_handler()
/linux-4.1.27/scripts/kconfig/
H A Dqconf.cc1205 split = new QSplitter(this); ConfigSearchWindow()
1206 split->setOrientation(Qt::Vertical); ConfigSearchWindow()
1207 list = new ConfigView(split, name); ConfigSearchWindow()
1209 info = new ConfigInfoView(split, name); ConfigSearchWindow()
1215 layout1->addWidget(split); ConfigSearchWindow()
1230 Q3ValueList<int> sizes = configSettings->readSizes("/split", &ok); ConfigSearchWindow()
1232 split->setSizes(sizes); ConfigSearchWindow()
1246 configSettings->writeSizes("/split", split->sizes()); saveSettings()
1464 else /*if (listMode == "split")*/ ConfigMainWindow()
1707 entry = "split"; saveSettings()
/linux-4.1.27/drivers/memory/
H A Dmvebu-devbus.c216 * split most of the values in the register into two fields: devbus_orion_set_timing_params()
219 * fields, we have to split the value into these two parts. devbus_orion_set_timing_params()
/linux-4.1.27/drivers/net/wireless/iwlwifi/
H A Diwl-drv.h145 * The driver can be split into multiple modules, in which case some symbols
146 * must be exported for the sub-modules. However, if it's not split and
/linux-4.1.27/drivers/staging/ozwpan/
H A Dozusbsvc.c7 * The implementation of this service is split into two parts the first of which
9 * This split is to allow alternative protocols to be defined.
/linux-4.1.27/drivers/of/
H A Ddevice.c234 * it's not really legal to split it out with commas. We split it of_device_uevent()
/linux-4.1.27/drivers/infiniband/hw/mthca/
H A Dmthca_reset.c197 "split transaction control, aborting.\n"); mthca_reset()
204 "split transaction control, aborting.\n"); mthca_reset()
H A Dmthca_provider.h179 * - split cq/qp table lock into n separate (cache-aligned) locks,
181 * - split QP struct lock into three (one for common info, one for the
/linux-4.1.27/drivers/crypto/vmx/
H A Dghashp8-ppc.pl89 vsldoi $Hl,$zero,$H,8 # ... and split
223 foreach (split("\n",$code)) {
H A Dppc-xlate.pl199 if (ref($opcode) eq 'CODE') { $line = &$opcode($f,split(',',$line)); }
/linux-4.1.27/arch/tile/include/uapi/arch/
H A Dchip_tilegx.h162 /** Are the interrupt masks split up into 2 SPRs? */
165 /** Is the cycle count split up into 2 SPRs? */
H A Dchip_tilepro.h162 /** Are the interrupt masks split up into 2 SPRs? */
165 /** Is the cycle count split up into 2 SPRs? */
/linux-4.1.27/fs/xfs/libxfs/
H A Dxfs_da_btree.h108 * Storage for holding state during Btree searches and split/join ops.
131 xfs_da_state_path_t path; /* search/split paths */
H A Dxfs_trans_resv.c206 * worst case split in allocation btrees per extent assuming 4 extents:
271 * the directory btree could split: (max depth + v2) * dir block size
272 * the directory bmap btree could join or split: (max depth + v2) * blocksize
310 * the directory bmap btree could join or split: (max depth + v2) * blocksize
626 * worst case split in allocation btrees per extent assuming 4 extents:
665 * the inode bmap btree could join or split: max depth * block size
685 * the inode bmap btree could join or split: max depth * block size
H A Dxfs_symlink_remote.c75 * Checking of the symlink header is split into two parts. the verifier does
H A Dxfs_alloc.h66 * block for the additional bmap btree block due to a split of the
72 * needed freelist blocks is 4 fsbs _per AG_, a potential split of file's bmap
H A Dxfs_da_btree.c342 * Split a leaf node, rebalance, then possibly split
363 * If we need to insert and there isn't room, split the node, then xfs_da3_split()
365 * Note that we may split the root this way, but we need more fixup. xfs_da3_split()
381 * We split on the last layer, must we split the node? xfs_da3_split()
394 * Entry wouldn't fit, split the leaf again. xfs_da3_split()
425 * Record the newly split block for the next time thru? xfs_da3_split()
456 * There might be three blocks involved if a double split occurred, xfs_da3_split()
498 * parts (the split old root) that we just created. Copy block zero to
660 * Do we have to split the node? xfs_da3_node_split()
692 * point to a valid entry (not after one), but a split xfs_da3_node_split()
696 * If we had double-split op below us, then add the extra block too. xfs_da3_node_split()
2107 * a bmap btree split to do that.
/linux-4.1.27/fs/logfs/
H A Ddev_bdev.c93 /* Block layer cannot split bios :( */ __bdev_writeseg()
185 /* Block layer cannot split bios :( */ do_erase()
/linux-4.1.27/arch/s390/kernel/
H A Dirq.c42 * We can't add the split external and I/O sub classes since the first field
55 * The list of split external and I/O interrupts that appear only in
/linux-4.1.27/arch/metag/include/asm/
H A Dcacheflush.h29 /* Write through, virtually tagged, split I/D cache. */
88 /* Write through, physically tagged, split I/D cache. */
/linux-4.1.27/tools/perf/tests/
H A Dattr.py80 a_list = a.split('|')
81 b_list = b.split('|')
H A Dvmlinux-kallsyms.c35 * both vmlinux + .ko files and from /proc/kallsyms split by modules. test__vmlinux_matches_kallsyms()
55 * Load and split /proc/kallsyms into multiple maps, one per module. test__vmlinux_matches_kallsyms()
/linux-4.1.27/include/linux/ceph/
H A Dceph_fs.h433 /* one for each node split */
742 __le64 split; /* ino to split off, if any */ member in struct:ceph_mds_snap_head
747 /* followed by split ino list, then split realms, then the trace blob */
/linux-4.1.27/block/
H A Dbio.c1811 * bio_split - split a bio
1812 * @bio: bio to split
1813 * @sectors: number of sectors to split from the front of @bio
1822 * @bio is not freed before the split.
1827 struct bio *split = NULL; bio_split() local
1837 split = bio_clone_bioset(bio, gfp, bs); bio_split()
1839 split = bio_clone_fast(bio, gfp, bs); bio_split()
1841 if (!split) bio_split()
1844 split->bi_iter.bi_size = sectors << 9; bio_split()
1846 if (bio_integrity(split)) bio_split()
1847 bio_integrity_trim(split, 0, sectors); bio_split()
1849 bio_advance(bio, split->bi_iter.bi_size); bio_split()
1851 return split; bio_split()
/linux-4.1.27/drivers/net/wan/
H A Dsdla.c764 short dlci, len, len2, split; sdla_receive() local
853 /* is this buffer split off the end of the internal ring buffer */ sdla_receive()
854 split = addr + len > buf_top + 1 ? len - (buf_top - addr + 1) : 0; sdla_receive()
855 len2 = len - split; sdla_receive()
858 if (split) sdla_receive()
859 __sdla_read(dev, buf_base, skb_put(skb, split), split); sdla_receive()
/linux-4.1.27/drivers/scsi/
H A Dscript_asm.pl417 foreach $rest (split (/\s*,\s*/, $rest)) {
440 foreach $external (split (/,/,$externals)) {
689 foreach $arg (split (/\s+AND\s+/i,$list)) {
810 foreach $j (split (/\s+/,$symbol_references{$i})) {
827 for $reference (split(/\s+/,$symbol_references{$external})) {
858 for $reference (split(/\s+/,$symbol_references{$label})) {
941 foreach $j (split (/\s+/,$symbol_references{$i})) {
/linux-4.1.27/drivers/md/bcache/
H A Dextents.c362 * k might have been split since we inserted/found the bch_extent_insert_fixup()
397 * means we have to split the old key. But we have to do bch_extent_insert_fixup()
411 * to represent the bottom split. bch_extent_insert_fixup()
H A Dbtree.c105 * going to have to split), set op->lock and return -EINTR; btree_root() will
1910 * Might land in the middle of an existing extent and have to split it insert_u64s_remaining()
1964 bool split; btree_split() local
1977 WARN(1, "insufficient reserve for split\n"); btree_split()
1984 split = set_blocks(btree_bset_first(n1), btree_split()
1987 if (split) { btree_split()
2056 /* Root filled up but didn't need to be split */ btree_split()
2084 WARN(1, "bcache: btree split failed (level %u)", b->level); btree_split()
2113 goto split; bch_btree_insert_node()
2131 split: bch_btree_insert_node()
/linux-4.1.27/drivers/pci/hotplug/
H A Dcpqphp_ctrl.c436 * we may be able to split some off of the front do_pre_bridge_resource_split()
443 * and split it up. do_pre_bridge_resource_split()
538 * window. If it finds a node larger than "size" it will split it up.
562 * so we'll make a new entry and split it up get_io_resource()
588 * so we'll make a new entry and split it up get_io_resource()
659 * so we'll make a new entry and split it up get_max_resource()
683 * so we'll make a new entry and split it up get_max_resource()
724 * get_resource - find resource of given size and split up larger ones.
730 * larger than "size" it will split it up.
756 * so we'll make a new entry and split it up get_resource()
782 * so we'll make a new entry and split it up get_resource()
2634 /* Check if we were able to split something off */ configure_new_function()
2646 /* Check if we were able to split something off */ configure_new_function()
2685 /* Check if we were able to split something off */ configure_new_function()
2697 /* Check if we were able to split something off */ configure_new_function()
2737 /* Check if we were able to split something off */ configure_new_function()
2749 /* Check if we were able to split something off */ configure_new_function()
/linux-4.1.27/drivers/net/can/c_can/
H A Dc_can.h25 /* message object split */
/linux-4.1.27/drivers/media/usb/as102/
H A Das102_fw.c64 /* parse line to split addr / data */ parse_hex_line()
/linux-4.1.27/drivers/rtc/
H A Drtc-omap.c37 * Board-specific wiring options include using split power mode with
600 /* On boards with split power, RTC_ON_NOFF won't reset the RTC */ omap_rtc_probe()
619 * rather than nPWRON_RESET, should forcibly enable split omap_rtc_probe()
625 dev_info(&pdev->dev, "split power mode\n"); omap_rtc_probe()
/linux-4.1.27/drivers/crypto/
H A Dmxs-dcp.c271 int split = 0; mxs_dcp_aes_block_crypt() local
316 if (!split) { mxs_dcp_aes_block_crypt()
330 split = 0; mxs_dcp_aes_block_crypt()
332 split = 1; mxs_dcp_aes_block_crypt()
/linux-4.1.27/drivers/gpu/drm/msm/hdmi/
H A Dhdmi.h114 * so split the phy related functions out and load the correct one at
/linux-4.1.27/drivers/gpu/drm/tilcdc/
H A Dtilcdc_drv.h92 * hdmi encoder, various lcd panels), the connector/encoder(s) are split into
/linux-4.1.27/drivers/gpu/drm/vmwgfx/
H A Dvmwgfx_gmr.c66 * Need to split the command if there are too many vmw_gmr2_bind()
/linux-4.1.27/include/trace/events/
H A Dblock.h541 * block_split - split a single bio struct into two bio structs
543 * @bio: block operation being split
546 * The bio request @bio in request queue @q needs to be split into two
548 * @new_sector. This split may be required due to hardware limitation
/linux-4.1.27/include/uapi/asm-generic/
H A Dfcntl.h10 * flags are split.
/linux-4.1.27/include/linux/usb/
H A Dr8a66597.h354 #define CSCLR 0x2000 /* b13: complete-split status clear */
355 #define CSSTS 0x1000 /* b12: complete-split status */
400 #define CSCLR 0x2000 /* b13: complete-split status clear */
401 #define CSSTS 0x1000 /* b12: complete-split status */
/linux-4.1.27/include/uapi/sound/
H A Dasound_fm.h84 unsigned char kbd_split; /* keyboard split */
/linux-4.1.27/arch/sh/boards/mach-x3proto/
H A Dilsel.c22 * ILSEL is split across:
/linux-4.1.27/arch/mips/sibyte/swarm/
H A Drtc_xicor1241.c141 /* year is split */ xicor_set_time()
/linux-4.1.27/arch/mn10300/mm/
H A Dcache-flush-icache.c142 /* split over two virtually contiguous pages */ flush_icache_range()
H A Dcache-inv-icache.c117 /* split over two virtually contiguous pages */ flush_icache_range()
/linux-4.1.27/arch/ia64/oprofile/
H A Dbacktrace.c105 /* TODO: split rather than drop the 2nd half */ do_ia64_backtrace()
/linux-4.1.27/arch/arm/kvm/
H A Dinit.S47 * need six), we split the init in two phases:
/linux-4.1.27/arch/arm/mach-omap2/
H A Dclkt2xxx_dpllcore.c18 * XXX The DPLL and CORE clocks should be split into two separate clock
/linux-4.1.27/arch/arc/plat-arcfpga/
H A Dsmp.c10 * Vineet Gupta - 2012 : split off arch common and plat specific SMP
/linux-4.1.27/fs/dlm/
H A Dmidcomms.c20 * split them up into packets and pass them to the interested
/linux-4.1.27/net/hsr/
H A Dhsr_main.h67 * left). This, however, would mean that the LSDU field would be split in two
/linux-4.1.27/tools/power/cpupower/utils/helpers/
H A Dhelpers.h43 * to split debug output away from normal output
/linux-4.1.27/tools/testing/selftests/powerpc/vphn/
H A Dtest-vphn.c277 /* Parse a 32-bit value split accross two consecutives 64-bit
/linux-4.1.27/drivers/net/ethernet/intel/e1000/
H A De1000.h108 #define E1000_RXBUFFER_128 128 /* Used for packet split */
109 #define E1000_RXBUFFER_256 256 /* Used for packet split */
/linux-4.1.27/drivers/video/fbdev/core/
H A Dcfbcopyarea.c20 * The two functions or copying forward and backward could be split up like
402 // split the base of the framebuffer into a long-aligned address and the cfb_copyarea()
/linux-4.1.27/tools/perf/Documentation/
H A DMakefile288 $(QUIET_MAKEINFO)$(MAKEINFO) --no-split -o $@ $(OUTPUT)user-manual.texi
311 $(QUIET_MAKEINFO)$(MAKEINFO) --no-split --no-validate $*.texi
/linux-4.1.27/drivers/media/pci/saa7134/
H A Dsaa7134-core.c385 u32 split, task=0, ctrl=0, irq=0; saa7134_set_dmabits() local
448 split = 0; saa7134_set_dmabits()
450 /* split fields between tasks */ saa7134_set_dmabits()
462 split = 1; saa7134_set_dmabits()
477 dprintk("dmabits: task=0x%02x ctrl=0x%02x irq=0x%x split=%s\n", saa7134_set_dmabits()
478 task, ctrl, irq, split ? "no" : "yes"); saa7134_set_dmabits()
/linux-4.1.27/fs/ocfs2/
H A Drefcounttree.c1483 * find the split cpos easily. ocfs2_divide_leaf_refcount_block()
1864 * If we just need to split the header or tail clusters, ocfs2_split_refcount_rec()
1865 * no more recs are needed, just split is OK. ocfs2_split_refcount_rec()
1878 * We need one more rec if we split in the middle and the new rec have ocfs2_split_refcount_rec()
1943 * If we have "len", the we will split in the tail and move it ocfs2_split_refcount_rec()
1956 * If the split pos isn't the same as the original one, we need to ocfs2_split_refcount_rec()
1957 * split in the head. ocfs2_split_refcount_rec()
2026 * 3. If we are in the middle of one extent record, split __ocfs2_increase_refcount()
2204 struct ocfs2_refcount_rec split = *rec; ocfs2_decrease_refcount_rec() local
2205 split.r_cpos = cpu_to_le64(cpos); ocfs2_decrease_refcount_rec()
2206 split.r_clusters = cpu_to_le32(len); ocfs2_decrease_refcount_rec()
2208 le32_add_cpu(&split.r_refcount, -1); ocfs2_decrease_refcount_rec()
2212 &split, index, 1, ocfs2_decrease_refcount_rec()
2347 * split. An attempt will be made at merging with adjacent extents.
2450 * 1) split at the beginning if the start pos isn't aligned. ocfs2_calc_refcount_meta_credits()
2452 * 2) split int the end if the end pos isn't aligned. ocfs2_calc_refcount_meta_credits()
2454 * 3) split in the middle because of file system fragmentation. ocfs2_calc_refcount_meta_credits()
2460 /* Check whether we need a split at the beginning. */ ocfs2_calc_refcount_meta_credits()
2465 /* Check whether we need a split in the end. */ ocfs2_calc_refcount_meta_credits()
2499 * block is also full and needs split. ocfs2_calc_refcount_meta_credits()
2531 * We will at most add split 2 refcount records and 2 more
2741 * need to calculate how we're going to split the extent. ocfs2_refcount_cal_cow_clusters()
2852 * 1. since we may split the old tree, so we at most will need num_clusters + 2
3598 * one will split a refcount rec, so totally we need ocfs2_refcounted_xattr_delete_need()
/linux-4.1.27/drivers/staging/octeon-usb/
H A Docteon-hcd.c249 * be in. Note that split completes are always even. This is so
325 * @split_sc_frame: The low order bits of the frame number the split
373 * active_split: Points to the current active split, or NULL.
590 * Returns: Non zero if we need to do split transactions
1623 * We need to do split transactions when we are talking to non cvmx_usb_start_channel()
1628 * On the start split phase (stage is even) record the cvmx_usb_start_channel()
1629 * frame number we will need to send the split complete. cvmx_usb_start_channel()
1668 * Clear the split complete frame number as cvmx_usb_start_channel()
1669 * there isn't going to be a split complete cvmx_usb_start_channel()
1846 /* Remeber when we start a split transaction */ cvmx_usb_start_channel()
2089 /* If this was a split then clear our split in progress marker */ cvmx_usb_perform_complete()
2662 * response to a ping, as a response to a split transaction, and cvmx_usb_poll_channel()
2679 * Split transactions retry the split complete 4 times cvmx_usb_poll_channel()
2680 * then rewind to the start split and do the entire cvmx_usb_poll_channel()
2687 * anding off the split complete bit cvmx_usb_poll_channel()
2803 * finishes with an ACK is during a split transaction. cvmx_usb_poll_channel()
2857 * complete split stage. Instead they use a cvmx_usb_poll_channel()
2913 * If this was a split then clear our split in progress marker. cvmx_usb_poll_channel()
2920 * to the beginning of the transaction by anding off the split cvmx_usb_poll_channel()
3153 * split transactions. octeon_usb_urb_enqueue()
3176 * split. octeon_usb_urb_enqueue()
/linux-4.1.27/arch/x86/mm/
H A Dpageattr.c475 * Check for races, another CPU might have split this page try_preserve_large_page()
569 * change the large page in one go. We request a split, when try_preserve_large_page()
604 * Check for races, another CPU might have split this page __split_large_page()
658 * Install the new, split up pagetable. __split_large_page()
1202 * We have to split the large page: __change_page_attr()
1222 * just split large page entry. __change_page_attr()
1848 * and hence no memory allocations during large page split. __kernel_map_pages()

Completed in 10643 milliseconds

12345