Loading...
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 | /* * Copyright 2013 Red Hat Inc. * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL * THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR * OTHER DEALINGS IN THE SOFTWARE. * * Authors: Ben Skeggs */ #ifdef INCLUDE_PROC process(PROC_HOST, #host_init, #host_recv) #endif /****************************************************************************** * HOST data segment *****************************************************************************/ #ifdef INCLUDE_DATA // HOST (R)FIFO packet format .equ #fifo_process 0x00 .equ #fifo_message 0x04 .equ #fifo_data0 0x08 .equ #fifo_data1 0x0c // HOST HOST->PWR queue description .equ #fifo_qlen 4 // log2(size of queue entry in bytes) .equ #fifo_qnum 3 // log2(max number of entries in queue) .equ #fifo_qmaskb (1 << #fifo_qnum) // max number of entries in queue .equ #fifo_qmaskp (#fifo_qmaskb - 1) .equ #fifo_qmaskf ((#fifo_qmaskb << 1) - 1) .equ #fifo_qsize (1 << (#fifo_qlen + #fifo_qnum)) fifo_queue: .skip 128 // #fifo_qsize // HOST PWR->HOST queue description .equ #rfifo_qlen 4 // log2(size of queue entry in bytes) .equ #rfifo_qnum 3 // log2(max number of entries in queue) .equ #rfifo_qmaskb (1 << #rfifo_qnum) // max number of entries in queue .equ #rfifo_qmaskp (#rfifo_qmaskb - 1) .equ #rfifo_qmaskf ((#rfifo_qmaskb << 1) - 1) .equ #rfifo_qsize (1 << (#rfifo_qlen + #rfifo_qnum)) rfifo_queue: .skip 128 // #rfifo_qsize #endif /****************************************************************************** * HOST code segment *****************************************************************************/ #ifdef INCLUDE_CODE // HOST->PWR comms - dequeue message(s) for process(es) from FIFO // // $r15 - current (host) // $r0 - zero host_send: nv_iord($r1, NV_PPWR_FIFO_GET(0)) nv_iord($r2, NV_PPWR_FIFO_PUT(0)) cmp b32 $r1 $r2 bra e #host_send_done // calculate address of message and $r14 $r1 #fifo_qmaskp shl b32 $r14 $r14 #fifo_qlen add b32 $r14 #fifo_queue // read message data, and pass to appropriate process ld b32 $r11 D[$r14 + #fifo_data1] ld b32 $r12 D[$r14 + #fifo_data0] ld b32 $r13 D[$r14 + #fifo_message] ld b32 $r14 D[$r14 + #fifo_process] call(send) // increment GET add b32 $r1 0x1 and $r14 $r1 #fifo_qmaskf nv_iowr(NV_PPWR_FIFO_GET(0), $r14) bra #host_send host_send_done: ret // PWR->HOST comms - enqueue message for HOST to RFIFO // // $r15 - current (host) // $r14 - process // $r13 - message // $r12 - message data 0 // $r11 - message data 1 // $r0 - zero host_recv: // message from intr handler == HOST->PWR comms pending imm32($r1, PROC_KERN) cmp b32 $r14 $r1 bra e #host_send // wait for space in RFIFO host_recv_wait: nv_iord($r1, NV_PPWR_RFIFO_GET) nv_iord($r2, NV_PPWR_RFIFO_PUT) xor $r1 #rfifo_qmaskb cmp b32 $r1 $r2 bra e #host_recv_wait and $r3 $r2 #rfifo_qmaskp shl b32 $r3 #rfifo_qlen add b32 $r3 #rfifo_queue // enqueue message st b32 D[$r3 + #fifo_data1] $r11 st b32 D[$r3 + #fifo_data0] $r12 st b32 D[$r3 + #fifo_message] $r13 st b32 D[$r3 + #fifo_process] $r14 add b32 $r2 0x1 and $r2 #rfifo_qmaskf nv_iowr(NV_PPWR_RFIFO_PUT, $r2) // notify host of pending message mov $r2 NV_PPWR_INTR_TRIGGER_USER0 nv_iowr(NV_PPWR_INTR_TRIGGER, $r2) ret // $r15 - current (host) // $r0 - zero host_init: // store each fifo's base/size in H2D/D2H scratch regs mov $r1 #fifo_qsize shl b32 $r1 16 or $r1 #fifo_queue nv_iowr(NV_PPWR_H2D, $r1); mov $r1 #rfifo_qsize shl b32 $r1 16 or $r1 #rfifo_queue nv_iowr(NV_PPWR_D2H, $r1); // enable fifo subintr for first fifo mov $r1 1 nv_iowr(NV_PPWR_FIFO_INTR_EN, $r1) ret #endif |