-
Notifications
You must be signed in to change notification settings - Fork 1
/
fops.c
1842 lines (1624 loc) · 44.4 KB
/
fops.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Vector Engine Driver
*
* Copyright (C) 2017-2018 NEC Corporation
* This file is part of VE Driver.
*
* VE Driver is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* VE Driver is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public
* License along with the VE Driver; if not, see
* <http://www.gnu.org/licenses/>.
*/
/*
* @file fops.c
* @brief VE driver file operations.
*/
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/errno.h>
#include <linux/moduleparam.h>
#include <linux/kthread.h>
#include <linux/cdev.h>
#include <linux/fs.h>
#include <linux/file.h>
#include <linux/pci.h>
#include <linux/interrupt.h>
#include <linux/wait.h>
#include <linux/mm.h>
#include <linux/mutex.h>
#include <linux/cred.h>
#include <linux/delay.h>
#include <linux/poll.h>
#include <linux/pid.h>
#include <linux/pid_namespace.h>
#include "ve_drv.h"
#include "internal.h"
#include <linux/version.h>
#if (KERNEL_VERSION(4, 11, 0) <= LINUX_VERSION_CODE)
#include <linux/sched/task.h>
#include <linux/sched/mm.h>
#endif
/**
* @brief open method of VE file operation
*
* @param[in] ino: inode structure of opening
* @param[in] filp: file structure of opening
*
* @return 0 on success.
* -EBUSY on the the task already exist.
* -ENOMEM on no memory.
* -ESRCH on no such pid.
*/
int ve_drv_open(struct inode *ino, struct file *filp)
{
struct list_head *ptr;
struct ve_task *task;
struct ve_dev *vedev;
struct ve_node *node;
struct list_head *head;
unsigned long flags;
struct pid *pid;
vedev = container_of(ino->i_cdev, struct ve_dev, cdev);
pdev_trace(vedev->pdev);
/* for unmapping */
vedev->dev_mapping = &ino->i_data;
pid = get_task_pid(current, PIDTYPE_PID);
if (pid == NULL)
return -ESRCH;
node = vedev->node;
head = &node->task_head;
/* Check if the pid is already in the list */
spin_lock_irqsave(&node->lock, flags);
list_for_each(ptr, head) {
task = list_entry(ptr, struct ve_task, list);
if (task->pid != pid)
continue;
pdev_dbg(vedev->pdev, "task %d already exists\n",
pid_vnr(task->pid));
spin_unlock_irqrestore(&node->lock, flags);
put_pid(pid);
return -EBUSY;
}
/* block open, device will be deleted */
if( vedev->remove_processing ){
spin_unlock_irqrestore(&node->lock, flags);
pdev_dbg(vedev->pdev,"device will be deleted, open is blocked\n");
put_pid(pid);
return -EINTR;// -ENODEV;
}
spin_unlock_irqrestore(&node->lock, flags);
task = kmalloc(sizeof(struct ve_task), GFP_KERNEL);
if (!task) {
put_pid(pid);
return -ENOMEM;
}
init_waitqueue_head(&task->waitq);
init_waitqueue_head(&task->waitq_dead);
task->wait_cond = 0;
task->wait_cond_dead = 0;
task->state = TASK_STATE_NEW;
task->vedev = vedev;
task->exs = 0;
task->pid = pid;
task->mm = NULL;
task->mmap = false;
task->ownership = false;
filp->private_data = task;
INIT_LIST_HEAD(&task->list);
spin_lock_irqsave(&node->lock, flags);
list_add(&task->list, head);
spin_unlock_irqrestore(&node->lock, flags);
pdev_dbg(vedev->pdev, "task %d has been created\n",
pid_vnr(task->pid));
/* reference dev */
ve_drv_device_get(vedev);
return 0;
}
/**
* @brief Read EXS register value
* Firstly try to get EXS value from EXSRAR target address.
* In the case of timeout, read it from MMIO address.
*
* @param[in] vedev: VE device structure
* @param core_id: VE core ID
*
* @return EXS value
*/
static inline uint64_t ve_get_exs(struct ve_dev *vedev, int core_id)
{
u64 timeout_jiffies;
uint64_t exs = 0;
int count = 0;
pdev_trace(vedev->pdev);
/* get current jiffies and convert it to usec */
timeout_jiffies = get_jiffies_64() +
msecs_to_jiffies(exsrar_poll_timeout_msec);
/* poll EXS register */
do {
//state is +->10b -->11b -->01b+
// <-------------------+
exs = vedev->arch_class->get_exs(vedev, core_id);
// 10b:EXECUTE
if ((exs & (EXS_STATE_RUN | EXS_STATE_STOP)) == EXS_STATE_RUN) {
//ve_get_exs is called in run state
pdev_dbg(vedev->pdev, "EXS is STATE_RUN(0x%llx) count=%d\n",exs,count);
return exs;
}
// 01b:HALT
if ((exs & (EXS_STATE_RUN | EXS_STATE_STOP)) == EXS_STATE_STOP) {
if (count > 0) {
//ve_get_exs is called in before halt state, and then halted.
pdev_dbg(vedev->pdev, "EXS is STATE_STOP(0x%llx) count =%d\n",exs,count);
}
return exs;
}
// 11b:BEFORE HALT
count++;
ndelay(exsrar_poll_delay_nsec);
} while (time_before64(get_jiffies_64(), timeout_jiffies));
//stil before halt state
pdev_err(vedev->pdev, "EXS is still before halt state. STATE(0x%llx) count =%d\n",exs,count);
return exs;
}
/**
* @brief Wait for VE core exception
*
* @param[in] filp: file pointer of ioctl
* @param[out] user_exs: EXS value will be set
*
* @return 0 on success.
* -EAGAIN if O_NONBLOCK flag is enabled.
* -EINTR if interrupted by signal.
* -ESRCH if the VE task id is not same as current tid
* if task is not created.
*/
int ve_drv_wait_exception(struct file *filp, uint64_t __user *user_exs)
{
struct ve_task *task;
struct ve_dev *vedev;
struct ve_node *node;
unsigned long flags;
struct pid *pid;
int core_id, ret;
uint64_t exs = 0;
uint16_t noc;
task = filp->private_data;
vedev = task->vedev;
node = vedev->node;
noc = node->core_fls;
pdev_trace(vedev->pdev);
/*
* TODO: This is workaround. Get mm should be removed.
*/
/* This is a limitation of the workaround */
if (unlikely(task->mmap == true)) {
pdev_dbg(vedev->pdev,
"task %d has memory map\n",
pid_vnr(task->pid));
return -EINVAL;
}
/*
* Raise reference count of mm here
* it will be put in .release
*/
if (unlikely(task->mm == NULL))
task->mm = get_task_mm(current);
/*
* Just for getting struct pid.
* We can call put_pid() immediately since
* get_pid was already done at open().
*/
pid = get_task_pid(current, PIDTYPE_PID);
if (pid == NULL)
return -ESRCH;
put_pid(pid);
spin_lock_irqsave(&node->lock, flags);
/* Check if the task is in waitable state */
switch (task->state) {
case TASK_STATE_READY:
case TASK_STATE_ASSIGNED:
break;
default:
spin_unlock_irqrestore(&node->lock, flags);
return -ESRCH;
}
pdev_dbg(vedev->pdev, "task %d (%d)\n", pid_nr(task->pid), task->state);
if (filp->f_flags & O_NONBLOCK) {
spin_unlock_irqrestore(&node->lock, flags);
return -EAGAIN;
}
spin_unlock_irqrestore(&node->lock, flags);
pdev_dbg(vedev->pdev, "task %d sleep\n", pid_nr(task->pid));
ret = wait_event_interruptible(task->waitq,
task->wait_cond);
if (ret)
return -EINTR;
pdev_dbg(vedev->pdev, "task %d awake\n", pid_nr(task->pid));
spin_lock_irqsave(&node->lock, flags);
task->wait_cond = 0;
/* Get EXS value */
if (task->exs != 0) {
/* the task is already unassigned */
exs = task->exs;
task->exs = 0;
pdev_dbg(vedev->pdev, "EXS value saved in task is used\n");
} else {
for (core_id = 0; core_id < noc; core_id++) {
if (node->core[core_id]->task == task) {
exs = ve_get_exs(vedev, core_id);
if (node->core[core_id]->count == 0) {
pdev_err(vedev->pdev,
"task %d wake up but interrupt count is zero (task->exs = %llx,exs = %llx)\n",
pid_nr(task->pid), task->exs, exs);
}
node->core[core_id]->count = 0;
break;
}
}
if (core_id >= noc)
pdev_err(vedev->pdev,
"task %d is unassigned but EXS was not saved\n",
pid_nr(task->pid));
}
task->last_exs = exs;
spin_unlock_irqrestore(&node->lock, flags);
/* Copy EXS value to the user space */
ret = put_user(exs, user_exs);
if (ret)
return -EFAULT;
pdev_dbg(vedev->pdev, "task %d return EXS = %llx\n",
pid_nr(task->pid), exs);
return 0;
}
/**
* @brief Get the number of VE core
*
* @param[in] vedev: VE device structure
*
* @return number of VE core
*/
int ve_drv_get_core_num(struct ve_dev *vedev)
{
pdev_trace(vedev->pdev);
return vedev->node->hw_info.num_of_core;
}
/**
* @brief Get physical memory size of VE
*
* @param[in] vedev: VE device structure
* @param[out] size: Size of memory will be stored
*
* @return 0 on success. Negative on failure.
*/
int ve_drv_get_memory_size(struct ve_dev *vedev, uint64_t __user *size)
{
pdev_trace(vedev->pdev);
return put_user(vedev->node->hw_info.memory_size, size);
}
/**
* @brief Print task information to the buffer
* This function is called via sysfs
*
* @param[in] node: VE node structure
* @param[out] buf: string buffer to be filled
* @param released: print released task only if it is 1
*
* @return length of buffer
*/
int print_task_info(struct ve_dev *vedev, char *buf, int released)
{
struct ve_node *node = vedev->node;
struct list_head *ptr;
struct ve_task *task;
unsigned long flags;
int ret, len;
if (buf == NULL)
return 0;
ret = 0;
spin_lock_irqsave(&node->lock, flags);
list_for_each(ptr, &node->task_head) {
task = list_entry(ptr, struct ve_task, list);
/* skip new task(including veos, mmm, etc) */
if (task->state == TASK_STATE_NEW)
continue;
if ((released & (task->state == TASK_STATE_RELEASED)) |
!released) {
len = snprintf(NULL, 0, "%d \n", pid_vnr(task->pid));
if (unlikely(ret+len >= PAGE_SIZE))
goto out;
len = scnprintf(buf + ret, PAGE_SIZE - ret,
"%d \n", pid_vnr(task->pid));
ret += (len - 1);
}
}
out:
spin_unlock_irqrestore(&node->lock, flags);
if (ret)
ret += 1;
else
ret = scnprintf(buf, PAGE_SIZE, " \n");
return ret;
}
#ifdef VE_DRV_DEBUG
/**
* @brief Print VE core information to the buffer
* This function is called via sysfs
*
* @param[in] node: VE node structure
* @param[out] buf: string buffer to be filled
*
* @return length of buffer
*/
int print_core_info(struct ve_node *node, char *buf)
{
int core_id;
unsigned long flags;
int ret, len;
if (buf == NULL)
return 0;
ret = 0;
spin_lock_irqsave(&node->lock, flags);
for (core_id = 0; core_id < node->core_fls; core_id++) {
len = sprintf(buf + ret, "core id: %d\n"
"\tintr count: %d\n"
"\tassigned tid: ",
node->core[core_id]->core_id,
node->core[core_id]->count);
ret += len;
if (node->core[core_id]->task != NULL) {
len = sprintf(buf + ret, "%d\n",
pid_vnr(node->core[core_id]->task->pid));
ret += len;
} else {
len = sprintf(buf + ret, "%s\n", "not assigned");
ret += len;
}
}
spin_unlock_irqrestore(&node->lock, flags);
return ret;
}
#endif
/**
* @brief Assign VE task to the VE core (internal function)
*
* @param[in] vedev: VE device structure
* @param tid_ns: VE task ID seen from namespace of current
* @param core_id: VE core ID
*
* @return 0 on success.
* -EINVAL on invalid core ID.
* -ESRCH on invalid task ID.
* on invalid task state.
* -EBUSY if some task is already assigned to the core.
* -EAGAIN if exception saved in task is not handled yet.
*/
static int
_ve_drv_assign_task_to_core(struct ve_dev *vedev, pid_t tid_ns, int core_id)
{
struct ve_node *node = vedev->node;
struct ve_hw_info *info = &node->hw_info;
struct list_head *head = &node->task_head;
struct list_head *ptr;
struct ve_task *task;
unsigned long flags;
int ret = 0;
pdev_trace(vedev->pdev);
if (!(info->core_enables & (1 << core_id)) || core_id < 0)
return -EINVAL;
spin_lock_irqsave(&node->lock, flags);
list_for_each(ptr, head) {
task = list_entry(ptr, struct ve_task, list);
if (pid_vnr(task->pid) == tid_ns)
goto found;
}
ret = -ESRCH;
goto unlock;
found:
if (node->core[core_id]->task != NULL) {
pdev_dbg(vedev->pdev, "task is not NULL\n");
ret = -EBUSY;
goto unlock;
}
if (task->exs || task->state == TASK_STATE_RELEASED) {
pdev_dbg(vedev->pdev, "exs = %llx, task->state = %d\n",
task->exs, task->state);
ret = -EAGAIN;
goto unlock;
}
if (task->state != TASK_STATE_READY) {
pdev_dbg(vedev->pdev, "task->state = %d\n", task->state);
ret = -ESRCH;
goto unlock;
}
node->core[core_id]->task = task;
task->state = TASK_STATE_ASSIGNED;
pdev_dbg(vedev->pdev, "%d is assigned to core %d\n", pid_vnr(task->pid),
core_id);
unlock:
spin_unlock_irqrestore(&node->lock, flags);
return ret;
}
/**
* @brief Assign VE task to the VE core
* This function is called via ioctl
*
* @param[in] vedev: VE device structure
* @param[in] arg: ioctl argument
*
* @return 0 on success.
* -EFAULT on invalid arg.
* -EINVAL on invalid core ID in arg.
* -ESRCH on invalid task ID in arg.
*/
int ve_drv_assign_task_to_core(struct ve_dev *vedev,
struct ve_tid_core __user *arg)
{
int err;
struct ve_tid_core tmp;
pdev_trace(vedev->pdev);
err = copy_from_user(&tmp, arg, sizeof(struct ve_tid_core));
if (err)
return -EFAULT;
else
return (_ve_drv_assign_task_to_core(vedev, tmp.tid,
tmp.core_id));
}
/**
* @brief Unassign VE task from VE core (internal function)
*
* @param[in] vedev: VE device structure
* @param[in] task: VE task structure
* @param force: unassign forcely
*
* @return 0 on success.
* -EINVAL if the VE task is not assigned to any VE core.
* -EBUSY if the VE core is in running state.
*/
static int _unassign_task_from_core(struct ve_dev *vedev, struct ve_task *task,
int force, int check_exsreg)
{
int core_id;
int count;
struct ve_node *node = vedev->node;
uint64_t exs = 0;
for (core_id = 0; core_id < node->core_fls; core_id++) {
if (node->core[core_id]->task != task)
continue;
if (force)
goto unassign;
/*
* NOTE: Since VEOS can manipulate the EXS register
* asynchronously, VE driver cannot assure that the core
* is in stopped state and all exception is solved
* during VE task unassignment. Following checks are
* just for preventing VEOS from bug.
*/
exs = vedev->arch_class->get_exs(vedev, core_id);
if (exs & EXS_STATE_RUN)
return -EBUSY;
/* Check if the VE core is in exceptional state */
count = node->core[core_id]->count;
if (count > 0) {
pdev_dbg(vedev->pdev,
"task %d interrupt is not handled yet\n",
pid_vnr(task->pid));
/* Save EXS to task structure */
node->core[core_id]->count = 0;
if( check_exsreg ){
task->exs = exs;
/*
* Wait for the write to *EXSRAR to complete, then
* clears *EXSRAR, Use the value of the EXS register
* instead of *EXSRAR.
*/
ve_get_exs(vedev, core_id);
} else
task->exs = ve_get_exs(vedev, core_id);
pdev_dbg(vedev->pdev,
"Saving exs value to the task %d (task->exs = %llx)\n",
pid_vnr(task->pid), task->exs);
if( check_exsreg == 0 ){
/* only VE1 */
/* wake the task */
task->wait_cond = 1;
wake_up_interruptible(&task->waitq);
}
} else {
/*
* Interrupt has not been arrived yet so we return
* -EAGAIN to wait for that
*/
if (vedev->arch_class->core_intr_undelivered(vedev,
core_id))
return -EAGAIN;
// Not interrupt,
// last_exs is 0 and this time have exception cause.
//
if( check_exsreg &&
( (EXS_EXCEPTION_MASK|EXS_RDBG) & task->last_exs ) == 0 &&
( (EXS_EXCEPTION_MASK|EXS_RDBG) & exs ) ){
pdev_dbg(vedev->pdev, "task %d is unassigned from core 0x%llx:0x%llx\n",
pid_vnr(task->pid),task->last_exs, exs );
task->exs = exs;
task->wait_cond = 1;
wake_up_interruptible(&task->waitq);
}
}
unassign:
/* Unassign the task from the core */
node->core[core_id]->task = NULL;
if (task->state != TASK_STATE_RELEASED)
task->state = TASK_STATE_READY;
pdev_dbg(vedev->pdev, "task %d is unassigned from core\n",
pid_vnr(task->pid));
return 0;
}
return -EINVAL;
}
/**
* @brief Unassign VE task from VE core
* This function is called via ioctl
*
* @param[in] vedev: VE device structure
* @param tid_ns: VE task ID seen from namespace of current
* @param check_exsreg:: check exs register directly
*
* @return 0 on success.
* -ESRCH if the VE task is not found.
* -EINVAL if the VE task is not assigned to any VE core.
* -EBUSY if the VE core is in running state.
*/
int ve_drv_unassign_task_from_core(struct ve_dev *vedev, pid_t tid_ns, int check_exsreg)
{
struct ve_node *node = vedev->node;
struct list_head *head = &node->task_head;
struct list_head *ptr;
struct ve_task *task;
unsigned long flags;
int ret;
pdev_trace(vedev->pdev);
spin_lock_irqsave(&node->lock, flags);
list_for_each(ptr, head) {
task = list_entry(ptr, struct ve_task, list);
if (pid_vnr(task->pid) == tid_ns)
goto found;
}
spin_unlock_irqrestore(&node->lock, flags);
return -ESRCH;
found:
ret = _unassign_task_from_core(vedev, task, 0, check_exsreg);
spin_unlock_irqrestore(&node->lock, flags);
return ret;
}
/**
* @brief Delete VE task
* This function is called via ioctl
*
* @param[in] vedev: VE device structure
* @param tid_ns: VE task ID seen from namespace of current
*
* @return 0 on success.
* -EAGAIN if mutex lock is already locked or
* VE task can not be unassigned now.
* -ESRCH if the VE task of the ID is not found.
*/
int ve_drv_del_ve_task(struct ve_dev *vedev, pid_t tid_ns)
{
struct ve_node *node = vedev->node;
struct list_head *head = &node->task_head;
struct list_head *ptr, *n;
struct ve_task *task;
unsigned long flags;
int ret = 0;
pdev_trace(vedev->pdev);
spin_lock_irqsave(&node->lock, flags);
list_for_each_safe(ptr, n, head) {
task = list_entry(ptr, struct ve_task, list);
if (pid_vnr(task->pid) != tid_ns)
continue;
switch (task->state) {
case TASK_STATE_NEW:
break;
case TASK_STATE_READY:
/*
* set the state as deleted and delete the structure
* in release()
*/
task->state = TASK_STATE_DELETED;
break;
case TASK_STATE_ASSIGNED:
pdev_dbg(vedev->pdev,
"task %d is currently assigned to core.\n",
pid_vnr(task->pid));
pdev_dbg(vedev->pdev,
"Unassign from core and try again\n");
ret = -EAGAIN;
break;
case TASK_STATE_RELEASED:
/*
* wake up the sleeping task in release method.
*/
pdev_dbg(vedev->pdev,
"wake up task %d to delete itself\n",
pid_vnr(task->pid));
task->wait_cond_dead = 1;
wake_up(&task->waitq_dead);
break;
default:
pdev_dbg(vedev->pdev,
"task %d is already marked as deleted\n",
pid_vnr(task->pid));
/* Do nothing */
break;
}
goto out;
}
ret = -ESRCH;
out:
spin_unlock_irqrestore(&node->lock, flags);
return ret;
}
/**
* @brief Revive VE task
* This function change ve_task state
* from TASK_STATE_DELETED to TASK_STATE_READY
*
* @param[in] vedev: VE device structure
* @param tid_ns: VE task ID seen from namespace of current
*
* @return 0 on success.
* -EINVAL if the VE task is in non-revival state.
* -ESRCH if the VE task of the ID is not found.
*/
int ve_drv_revive_ve_task(struct ve_dev *vedev, pid_t tid_ns)
{
struct ve_node *node = vedev->node;
struct list_head *head = &node->task_head;
struct list_head *ptr, *n;
struct ve_task *task;
unsigned long flags;
int ret = 0;
pdev_trace(vedev->pdev);
spin_lock_irqsave(&node->lock, flags);
list_for_each_safe(ptr, n, head) {
task = list_entry(ptr, struct ve_task, list);
if (pid_vnr(task->pid) != tid_ns)
continue;
switch (task->state) {
case TASK_STATE_READY:
break;
case TASK_STATE_DELETED:
task->state = TASK_STATE_READY;
break;
default:
pdev_dbg(vedev->pdev,
"task %d cannot not be revived\n",
pid_vnr(task->pid));
ret = -EINVAL;
break;
}
goto out;
}
ret = -ESRCH;
out:
spin_unlock_irqrestore(&node->lock, flags);
return ret;
}
int ve_drv_del_all_task(struct ve_dev *vedev)
{
struct ve_node *node = vedev->node;
struct list_head *head = &node->task_head;
struct list_head *ptr, *n;
struct ve_task *task;
unsigned long flags;
pdev_trace(vedev->pdev);
spin_lock_irqsave(&node->lock, flags);
list_for_each_safe(ptr, n, head) {
task = list_entry(ptr, struct ve_task, list);
/* Unassign task forcely */
(void)_unassign_task_from_core(vedev, task, 1, 0);
switch (task->state) {
case TASK_STATE_NEW:
break;
case TASK_STATE_READY:
/*
* set the state as deleted and delete the structure
* in release method
*/
task->state = TASK_STATE_DELETED;
break;
case TASK_STATE_RELEASED:
/*
* wake up the sleeping task in release method.
*/
pdev_dbg(vedev->pdev,
"wake up task %d to delete itself\n",
pid_vnr(task->pid));
task->wait_cond_dead = 1;
wake_up(&task->waitq_dead);
break;
default:
pdev_dbg(vedev->pdev,
"task %d is already marked as deleted\n",
pid_vnr(task->pid));
/* Do nothing */
break;
}
}
spin_unlock_irqrestore(&node->lock, flags);
return 0;
}
/**
* @brief flush method of VE file operation
*
* @param[in] filp: file structure of flushing
* @param id: POSIX Owner ID of flushing (legacy argument)
*
* @return always 0.
*/
int ve_drv_flush(struct file *filp, fl_owner_t id)
{
/* currently nothing to do */
return 0;
}
/**
* @brief release method of VE file operation
* Currently there is nothing to do here.
*
* @param[in] ino: inode structure of releasing
* @param[in] filp: file structure of releasing
*
* @return always 0.
*/
int ve_drv_release(struct inode *ino, struct file *filp)
{
unsigned long flags;
struct ve_task *task, *list_task;
struct ve_dev *vedev;
struct ve_node *node;
struct list_head *head, *ptr, *n;
int ret;
vedev = container_of(ino->i_cdev, struct ve_dev, cdev);
pdev_trace(vedev->pdev);
/* Just in case */
if (filp->private_data == NULL) {
pdev_warn(vedev->pdev,
"filp->private_data was already released\n");
return 0;
}
task = filp->private_data;
node = vedev->node;
head = &node->task_head;
spin_lock_irqsave(&vedev->node->lock, flags);
switch (task->state) {
case TASK_STATE_ASSIGNED:
pdev_dbg(vedev->pdev,
"task %d is killed but still assigned to the core\n",
pid_vnr(task->pid));
#if (KERNEL_VERSION(5, 9, 0) <= LINUX_VERSION_CODE)
fallthrough;
#endif
case TASK_STATE_READY:
/*
* Change state to released.
* Then notify veos of it.
*/
task->state = TASK_STATE_RELEASED;
spin_unlock_irqrestore(&vedev->node->lock, flags);
sysfs_notify(&vedev->device->kobj, NULL,
"task_id_dead");
pdev_dbg(vedev->pdev, "task %d is released\n",
pid_vnr(task->pid));
/* block here for protecting IB resources */
wait_event(task->waitq_dead, task->wait_cond_dead);
spin_lock_irqsave(&vedev->node->lock, flags);
/*
* Unassign task from core if it is not unassigned yet.
* -EINVAL is expected. If success, it is VEOS bug.
* VEOS must unassign task before deleting.
*/
ret = _unassign_task_from_core(vedev, task, 0, 0);
if (ret != -EINVAL) {
pdev_err(vedev->pdev,
"VEOS BUG: task %d is deleted without unassign from core\n",
pid_vnr(task->pid));
}
break;
case TASK_STATE_NEW:
case TASK_STATE_DELETED:
/*
* Delete task structure right now.
*/
break;
default:
pdev_err(vedev->pdev, "ve_task %d invalid state (%d)\n",
pid_vnr(task->pid), task->state);
}
list_for_each_safe(ptr, n, head) {
list_task = list_entry(ptr, struct ve_task, list);
if (list_task == task) {
if( vedev->arch_class->ve_arch_release ){
vedev->arch_class->ve_arch_release(vedev,task);
}
pdev_dbg(vedev->pdev, "task %d is deleted\n",
pid_vnr(task->pid));
list_del(&task->list);
goto found;
}
}
pdev_warn(vedev->pdev, "task %d is not found in the list\n",
pid_vnr(task->pid));
found:
spin_unlock_irqrestore(&vedev->node->lock, flags);
put_pid(task->pid);
if (task->mm)
mmput(task->mm);
kfree(task);
filp->private_data = NULL;
/* de reference */
ve_drv_device_put(vedev);
return 0;
}
/**
* @brief Create VE task
* This function is called via ioctl.
*
* @param[in] vedev: VE device structure
* @param tid_ns: VE task ID seen from namespace of current
*
* @return 0 on success.
* -ESRCH if VE task ID is not found
*/
int ve_drv_add_ve_task(struct ve_dev *vedev, pid_t tid_ns)
{
struct ve_node *node = vedev->node;
struct list_head *head = &node->task_head;
struct list_head *ptr, *n;