summaryrefslogblamecommitdiff
path: root/nuttx/Documentation/NuttxUserGuide.html
blob: 46b4b2be4401ee6f0ced33155effb45225dc106d (plain) (tree)
1
2
3
4
5
6
7
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
      
 



                                           
 





                                                   
                
                      
   
             

          
                 
   
            
   
                                        
         
 






























































                                                                                                                              
            

                                                                     
             

                                                              
                                                

                                                                     


                                                             

                                                               

                                                                

                                                                   
                                                                   
     
   
                                                                 


                                                                 
    
 
                                                               

   
               
                                                                           

                                                                           

                                                                         
    
    

                                                                  

     



















                                                                                   
   










                                                              
 
                                                   
 

                           
     
                           
                                                                                               
      
 

                    



                                                         
                                                                 




                                                                                    
   










                                                                    




                                                              




                                                               







                                                                      



                                                                      


                          
    

    



                                                       
     
 



                                                          
                                                 
     


                                                                                       
      
 
   


                                                                  





                                                                                   
 
                                               
 

                           
     
                           

                                                                                          
      
 


                   
                                                      

                                                                 
    
   


                                                               









                                                                      



                                                                      
       
    

                        
    


                                                             
                                                            





                                                                        
                                             


                                                          
                                                 
     


                                                                                                            
      
 
   


                                                               





                                                                                   
 
                                                       
 

                           
     

                                      
      
 

                                                                         

                                                             



                                                              
                    












                                                                            
                                             


                                                          
                                                 
     
                                   
      
 
   


                                                                       


                                                                  
                                               
     
 
                                                   
 

                           
     

                                    
      
 

                                                                  

                                                                



                                                           
                                
     
 



                                               
                                                                                           
     
 


                                


                                                                         

                                                          
                                                 
     
                                 
      
 
   


                                                               

                                                                  
                                               

                                                    
 
                                      
 

                           
     




                                   
      
 

                                                                  


                                                                     




                          
 

                              
 

                                
 

                                                                     
     
                          
      
                       
     
                           
      
 
   

                                                                  


                                         
 
                                                     
 

                           
     

                                     
      
 

                                                              


                                                              



                                                           
                                
     
 



                        





                                                                                              
     
 



                                                          
                                                 
     
                                 
      
 
   

                                                                                     


                                                                 
                                                            
     
 
                                          
 

                           
     

                             
      
 

                                                            

                                                                    











                                    

                                                     
                                                                   
 


























                                                                          
 
                                                         


                            
                            


                                                                   
                     



























                                                                                                                        
 
















                                                                                                          
                              





                                                                       
 
                                                         
 

                           
     

                                                              
      
 

                                                              
                             























                                                                                              

                           
                                                                 

                           
     

                                                                                    
      

                     





                                                                              




                                                            
                                        





                                                                               

                                                                 



                          






                                                                
     
 



                                                      

                           
                                                               

                           
     

                                       
      

                     
                                                           
                                                     








                                                         



                         


                                                




                        






                                                                      




                                                      

                                                       


                                            
 
                                                    
 

                           
     

                            
      
 

                                                                 
                                                      











                                                      

                           
                                                                       
 

                           
     

                                           
      
 

                                                                  
                                                         















                                                      

                           
                                                                       
 

                           
     

                                            
      
 

                                                                 
                                                         















                                                      

                           
                                                                     
 

                           
     

                                                                     
      
 

                      






                                                                

                           
    

                                                            
                                         

                                                               
 

                          


                                                         










                                                                 


                             
                                                                
 






                                                              
 

                           
     

                              
      
 

                                                               



                                                                  











                                                             
                                          
     
                            
      
 
                                                     
 

                           
     

                                
      
 

                                                                




                                                                 











                                                             
                                          
     
                              
      
 
                                                           
 

                           
     

                                  
      
 

                                                              


                                                                     












                                       
 
                                                                       
 









                                                                        





                                                              
     
 
                                           
 

                           
     

                                                         
      
 

                                                                



                                                                  









                                                               
      


                                                   
 
                                   

                                                               

                                                                     


                                                                      
                                                                         








                                                                          












                                                                

                                                       

                                                                           

                                                                     
     
 
                                             
 

                           
     

                                
      
 

                                                              


                                                                 
   



                                                                      









                                                                  
           
     
 



                                

                                                                                
                                                                      
                                    


                                                                

                 
                                               
 

                           
     

                                        
      
 

                                                                 



                                                                  











                                                      

                           
                                           

                           

     
                             

                                                                       
   





                                                                                                                
   




                                                                                          
   



                                                                              
   


                                                                             
   

                           
    



                                                                   
     
   




                                                                            
    



















                                                                                                                                          
     






                                                     
 


















































































                                                                                                                                          
                                                 
   


                             
                             
                                                                         
      
   







                                                                                           
   




                                                                                                  
   

                                                                                                
   

                           
    



                                                                             
     
   



                                                                                                  
    



















                                                                                                                                         
     
   

                                  
   


                                                     
 





















































































                                                                                                                                         
 

                           
     
                             

                                                                    
 

                                                                   



                                                                        
   


                                                              
   


                                                                      






                                                               
        











                                                                

                                                       

                                                                       






                                                                           
     
 
                                                 
 

                           
     


                                                              
      
 

                                                                

                                                                                   
   


                                                               











                                                           
        
     
 



                                                      

                           
                                                 
 

                           
     

                                                         
      
 

                                                              
                                                       




                                                                     
                   


















                                                             

                           
                                                                   
 













                                                                               
                                                                           

                                                         
                                                                              
                                                        
                                                                         
                                     
                                                                                 
                                                                       
                                                                             

















                                                                               

                                                                         
                             
                                                                         
                     

                                                     















                                                        
 

                           
     

                                                                 
      
 

                                                                    


                                                                  
   



                                                                          

















                                                      

                                                       


                        
 
                                                   
 

                           
     

                                   
      
 

                                                                           




                                                                          
   

                                                                         















                                                      

                           
                                             
 

                           
     

                                                        
      
 

                                                                  





                                                                   
   


                                                                




                                                             
                           

                                                                 
       
                                                                  
                               
                                                               
                                                       

                            

                                                                      

                                                         

                                                      
                                                                           
                                                                           

                                                                         












                                                      

                                                       

                                                              
                          
     
 
                                               
 

                           
     

                                 
      
 

                                                                


                                                                 
   



                                                                  
   

                                                               















                                                                         
                   



                                                              

                           
                                                 
 

                           
     

                                        
      
 

                                                                        



                                                                        















                                                                         
                   



                                                               

                                                       

                                                              
                          
                                                                       

                                                                          
     
 
                                             
 

                           
     

                                
      
 

                                                                


                                                                            











                                         



                                                                           


                                                                    
          
                                                                    
                                                                        




                                                      

                           
                                                   
 

                           
     

                                   
      
 

                                                               

                                                                      










                                        



                                                                           


                                                                    
          







                                                                  

                           
                                             
 

                           
     

                                
      
 

                                                              

                                                                        
   


                                                                      
   


                                                                         















                                                                        

                                                             

                                                      

                           
                                                     
 

                           
     

                                               
      
 

                                                                 




                                                                 
   


                                                                
















                                                      

                           
    
 
                                                              
 
   




                                                                                                    

                                                                                               





                                                  
                                                    
     
 
                                               
 

                           
     

                             
      
 

                                                                 
                                                         





                                                                  
                                                                      
                                      
     
 



                                                             
                                                    
     
                            
      
 
   
                                               

                                                             
                     
     
 
                                               
 

                           
     
                           
                                    
      
 

                                                            

                                                              



                                                              
                                
     
 




                        
 

                                                               

                                                              

                                                             
                                                    
     
                                   
      
 
   
                                               

                                                                 
                                                    
     
 
                                             
 

                           
     
                           

                                                                
      
 

                                                              


                                                                
   


                                                                         
   
                                  
   
                                                                   
                                                            
                                                 

















                                                                     

                                                                

                                                             
                                                    
     
                                                                             
      
 
   
                                               

                                                                  

                                                                  
     
 
                                               

                           
     
                           
                                    
      
 

                                                             

                                                                  















                                                             
                                                    
     
                                   
      
 























                                                                                      
    
 
                                                          













                                                                 
                                                       























                                                                                  
                                       

     
                                                       























                                                                                  
                                       

     
                                                     























                                                                                 
                                       

     
                                          























                                                                             
                                       

     
                                             























                                                                             
                                       

     
                                                   




                                          
                                                     



































                                                                                                                         

                                                                          






















                                                                                                   






                                                                                                             
 
                                                     































                                                                                                                   



                                                     
 
                                                       

















































                                                                                                        

                                                                      






                                                                                                                     
                                                                                                                          












                                                                                                                                                   






                                                                                                             
 
                                                        

















                                                                                                         




                                                                        

















                                                                                        



                                                     
 
                                                              


























                                                                                             


                                                                     















                                                                                            






                                                                                                             
 


                                                   

                           
    
 
                                                    
 























                                                                                 












                                                          
     
 
                                                    
 

                           
     

                                   
      














                                                                      
 



                                                      

                           
                                                  
 

                           
     

                                  
      
 

                                                                      
                                          















                                                                  

                           
                                                
 

                           
     

                                            
      
 

                                                              
                                         
















                                                          

                           
                                                
 

                           
     

                                            
      
 

                                                              
                                              
















                                                          

                           
                                                    
 

                           
     

                                                     
      
 

                                                                    
                                                 


















                                                             

                           
                                                
 

                           
     


                                                          
      
 

                                                            

                                                                  
   

                                                                           


                                                                          
         
                                                                   
                                          


                                                                   





                                                                        
   





                                                                            
   

                                                                        
   


                                                                       

















                                                          

                                                  

                                                                  
                               
                                                             
                              
     
 
                                                    
 

                           
     

                                                                  
      
 

                                                            



                                                                     
   

                                                                           
   
                                                                   





                                                             
                                                                            
                                                               

                                                               
                                                             
                                             















                                                      

                           
                                                  
 

                           
     

                                    
      
 

                                                               

                                                              
   





                                                                          















                                                              

                           
                                                  
 

                           
     

                                          
      
 

                                                                      

                                                                        
   

                                                                      
   
                                                               
   

                                                                



                                                                 
          











                                                      

                                                 


                                                                      


                                                                          
     
 
                                                     
 

                           
     

                                                               
      
 

                                                                 
                                           










                                                                 
                       
     
 



                                                      

                           
                                                       
 

                           
     


                                                                
      
 

                                                                






                                                                            
   




                                                                  



















                                                                                          
                       
     
 



                                                      

                                             


                                                              
                                    
                                                                      




                                                                        
     
 
                                               
 

                           
     

                                                                
      
 

                                                               

                                                           
   





                                                                         











                                                   







                                                                                                                
     
 



                                                      

                                             



                                                                      


                                                                         
     
 
                                       
 

                           
     


                                
      
 

                    


















                                                                           
                                            
                                                                           
     

   



                          


    
                                  











                                                                            
                                                     









                                                                                    
    









































                                                                                        









                                                                                            
     

























































                                                                                                                                         
 



                                                              
     

                                                
      

                   

                                                                 








                                       
                                                                  

                                                     






                                                   
                           




                                                                    
     

                                                   
      

                   
                                                                








                                       
                                                                     

                                                     






                                                   
                           




                                                                                  
     

                                                                      
      










                                       
                                                                            

                                                     






                                                   

                           



                                                                                  
     

                                                                       
      










                                       
                                                                            

                                                     






                                                   

                           



                                                                                 
     


                                                                       
      










                                       
                                                                            

                                                     






                                                   

                           



                                                                                
     


                                                                 
      










                                       
                                                                           

                                                     






                                                   

                           



                                                                                    
     


                                                          
      










                                       
                                                                             

                                                     






                                                   
                           




                                                                                    
     


                                                                 
      










                                       
                                                                             

                                                     






                                                   

                           



                                                                              
     

                                                                        
      










                                       
                                                                          

                                                     






                                                   

                           



                                                                               
     

                                                                        
      










                                       
                                                                          

                                                     






                                                   

                           



                                                          
     



                                                               
      

                   





                                                        








                                       
                                                               

                                                     






                                                   

                           



                                                          
     

                                         
      

                   

                                                         








                                       
                                                               

                                                     






                                                   

                           



                                                      
     

                                              
      

                   
                                          








                                       
                                                             

                                                     






                                                   

                           



                                                          
     

                                         
      

                   














                                                                           




                        
                                          



                       

                                                                                 


                 
                                                                                     



                                                   
                                        

                                                                             





                                                                              
     
 



                                                                          
     

                                                         
      


                                                          







                                                                                 



                        
                                                                                    
                    
                                                  



                       

                                                                                     


                 
                                                                                     



                                                   

                           



                                                                            
     
                              
                                     
      










                                       
                                                                       

                                                     






                                                   

                           



                                                      
     

                                                                 
      

                   

                                                             








                                       
                                                             

                                                     






                                                   

                           



                                                        
     

                              
      

                   

                                                         








                                       
                                                              

                                                     






                                                   

                           



                                                      
     

                                 
      

                   
                                                    








                                       
                                                             

                                                     






                                                   

                           
                                                                        



                            

                                                            

























































                                                                                               
 
                                                                        



                            

                                                           



















































































                                                                                               
 



                                                                 
     

                                                                           
      


                   





                                                           
   



                                                                





                                                                   


                                                   



                       



                                                            


                                                          


                                                    




                                                                 
                           







                                                                    
     

                                                             
      


                   






                                                              
   


                                                                     









                                                     

                                                                         


                                                                     
             





                                                   
                           

                                                                   
                    
     
 



                                                                    
     

                                                  
      


                   


                                                           
   


                                                                     








                                                     



                                                             



                                                   
                           

                                                                   
                    
     
 



                                                                 
     

                                               
      


                   


                                                                 















                                                   

                           



                                                                         
     

                                                          
      










                                       
                                                                       

                                                     






                                                   

                           



                                                                               
     

                                                             
      










                                       
                                                                          

                                                     






                                                   

                           



                                                                                     
     


                                                               
      










                                       
                                                                             

                                                     






                                                   

                           



                                                                                     
     


                                                              
      










                                       
                                                                             

                                                     






                                                   

                           



                                                                 
     


                                                         
      










                                       
                                                                   

                                                     






                                                   

                           



                                                                        
     

                                                      
      










                                       
                                                                      

                                                     






                                                   

                           



                                                                 
     

                                                   
      










                                       
                                                                   

                                                     






                                                   

                           



                                                                       
     

                                                      
      










                                       
                                                                      

                                                     






                                                   

                           



                                                                     
     

                                                     
      





                        
                             



                       
                                                                     

                                                     






                                                   

                           



                                                                      
     

                                                        
      










                                       
                                                                      

                                                     






                                                   

                           



                                                                             
     

                                                           
      










                                       
                                                                         

                                                     






                                                   

                           



                                                               
     

                                                                          
      










                                       
                                                                  

                                                     






                                                   

                           



                                                                     
     

                                                   
      










                                       
                                                                     

                                                     






                                                   

                           



                                                                         
     

                                                     
      










                                       
                                                                       

                                                     






                                                   

                           



                                                                   
     

                                                  
      










                                       
                                                                    

                                                     






                                                   

                           



                                                               
     

                                                                        
      








                                       
                         
   
                                                                  

                                                     






                                                   

                           
                                                                         



                            


                                                                            








                          
                                       









                                                                               
                                        





























































































































































































































































































































































































































































































                                                                                                                                     
 

                                                             
                         
   
                                                           
                                                                       
                                                                  
                  






            

                                        
   
                                                     



                                                                    







                 


                                                                   
   

                                                 
   

                                                                           


                          
                                         

                                                                 
                                       
   


                                                                                     








                                                        

                                      
   
                     
   

                                                                 
     
                                                  
      


                                 
   
                                                                
      
     



                         
      


                              
   
                                                             
                             
     




                                       
      


                             
   
                                                              
                                     
     





                                                                           
      


                               
   
                                                                    
     





                                                        





                                           
      
 

                                       
   

                                                             
     





                            
      


                           
   

                                                              
     




                      
      


                              
   

                                                              
     





                                
      
































                                                                 




















                                                                                            
                                                




                                                            




                                                   
















                                                                                            

                                                                                               






                                                                     
                                                                                               




                                                                            
                                                        





                                                           
                                                                                               
                                          

                                                                                               


                                                      
                                                                                               

           

                                  






                                                                  
                                   
                                                          
                                       
                                          

                                              
                                                
                                                                 
                                       






                                              

                                                        

                                                
                                               









                                                                                 






                                                                                     
















                                                                     
                                                  









                                                                                 
                                                  



                                                                      
                                                        



































                                                                        
                                                 







                                                             





                                                          



                                                        
                                              


                                          

       
<html>

<head>
<title>NuttX Users Manual</title>
<meta name="AUTHOR" content="Gregory Nutt">
</head>

<body background="backgd.gif">
<hr>
<hr>
<center><h1><i>Under Construction</i></h1></center>
<hr>
<hr>
<center><BIG><b>
NuttX Operating System
<p>
User's Manual
</b></BIG>
<p>
<small>by</small>
<p>
Gregory Nutt
<p>
<small>Last Update: May 27, 2007</small>
</center>

<h1>1.0 <A NAME="Introduction">Introduction</a></h1>

<p>
  This manual provides general usage information for the NuttX RTOS from the
    perspective of the firmware developer.

<h2>1.1 <a name="overview">Document Overview</a></h2>
<p>
  This user's manual is divided into three sections plus a index:
</p>
<ul>
  <li>
    <b>Section 1.0, <a href="#Introduction">Introduction</a></b>:
    This section provides an overview of the NuttX user's manual.
  </li>
  <li>
    <b>Section 2.0, <a href="#OS_Interfaces">OS Interfaces</a></b>:
    This section details the program interfaces provided by NuttX.
    This section is divided into several paragraphs that describe different groups of OS interfaces:
    <ul>
      <li>Paragraph 2.1 <a href="#Task_Control">Task Control Interfaces</a></li>
      <li>Paragraph 2.2 <a href="#Task_Schedule">Task Scheduling Interfaces</a></li>
      <li>Paragraph 2.3 <a href="#Task_Switch">Task Switching Interfaces</a></li>
      <li>Paragraph 2.4 <a href="#Message_Queue">Named Message Queue Interfaces</a></li>
      <li>Paragraph 2.5 <a href="#Semaphores">Counting Semaphore Interfaces</a></li>
      <li>Paragraph 2.6 <a href="#Watchdogs">Watchdog Timer Interfaces</a></li>
      <li>Paragraph 2.7 <a href="#ClocksNTimers">Clocks and Timers</a></li>
      <li>Paragraph 2.8 <a href="#Signals">Signal Interfaces</a></li>
      <li>Paragraph 2.9 <a href="#Pthread">Pthread Interfaces</a></li>
      <li>Paragraph 2.10 <a href="#FileSystem">Filesystem Interfaces</a></li>
    </ul>
  </li>
  <li>
    <b>Section 3.0, <a href="#Data_Structures">OS Data Structures</a></b>:
    This section documents the data structures that are used at the NuttX
    interface.
  </li>
  <li>
    <a href="#index">Index</a>
  </li>
</ul>

<h2>1.2 <a name="scope">Intended Audience and Scope</a></h2>
<p>
  The intended audience for this document are firmware developers who are implementing applications on NuttX.
  Specifically, this documented is limited to addressing only NuttX RTOS APIs that are available to the application developer.
  As such, this document does not focus on any technical details of the organization or implementation of NuttX.
  Those technical details are provided in the <a href="NuttxPortingGuide.html">NuttX Porting Guide</a>.
</p>
<p>
  Information about configuring and building NuttX is also needed by the application developer.
  That information can also be found in the <a href="NuttxPortingGuide.html#configandbuild">NuttX Porting Guide</a>.
</p>

<hr>

<h1>2.0 <A NAME="OS_Interfaces">OS Interfaces</a></h1>
<p>
  This section describes each C-callable interface to the NuttX
  Operating System. The description of each interface is presented
  in the following format:
<p>
<b>Function Prototype:</b> The C prototype of the interface function
is provided.
<p>
<b>Description:</b> The operation performed by the interface function
is discussed.
<p>
<b>Input Parameters:</b> All input parameters are listed along
with brief descriptions of each input parameter.
<p>
<b>Returned Values:</b> All possible values returned by the interface
function are listed. Values returned as side-effects (through
pointer input parameters or through global variables) will be
addressed in the description of the interface function.
<p>
<b>Assumptions/Limitations:</b> Any unusual assumptions made by
the interface function or any non-obvious limitations to the use
of the interface function will be indicated here.
<p>
<b>POSIX Compatibility:</b> Any significant differences between the
NuttX interface and its corresponding POSIX interface will be noted
here.
<p>
NOTE: In order to achieve an independent name space for the NuttX
interface functions, differences in function names and types are
to be expected and will not be identified as differences in these
paragraphs.
<hr>

<H2>2.1 <A NAME="Task_Control">Task Control Interfaces</a></H2>

<p>
  <b>Tasks</b>.
  NuttX is a flat address OS.  As such it does not support <i>processes</i>
  in the way that, say, Linux does.
  NuttX only supports simple threads running within the same address space.
  However, the programming model makes a distinction between <i>tasks</i>
  and <i>pthreads</i>:
</p>
<ul>
  <li><i>tasks</i> are threads which have a degree of independence
  <li><a href="#Pthread"><i>pthreads</i></a> share some resources.
</ul>
<p>
  <b>File Descriptors and Streams</b>.
  This applies, in particular, in the area of opened file descriptors and streams.
  When a task is started using the interfaces in this section, it will be created
  with at most three open files.
</p>
</p>
  If CONFIG_DEV_CONSOLE is defined, the first three file descriptors (corresponding
  to stdin, stdout, stderr) will be duplicated for the the new task.
  Since these file descriptors are duplicated, the child task can free close
  them or manipulate them in any way without effecting the parent task.
  File-related operations (open, close, etc.) within a task will have no effect
  on other tasks.
  Since the three file descriptors are duplicated, it is also possible to perform
  some level of redirection.
</p>
<p>
  pthreads, on the other hand, will always share file descriptors with the parent
  thread.  In this case, file operations will have effect only all pthreads the
  were started from the same parent thread.
</p>
<p>
  The following task control interfaces are provided by Nuttx:
</p>
<ul>
  <li><a href="#taskcreate">2.1.1 task_create</a></li>
  <li><a href="#taskinit">2.1.2 task_init</a></li>
  <li><a href="#taskactivate">2.1.3 task_activate</a></li>
  <li><a href="#taskdelete">2.1.4 task_delete</a></li>
  <li><a href="#exit">2.1.5 exit</a></li>
  <li><a href="#taskrestart">2.1.6 task_restart</a></li>
  <li><a href="#getpid">2.1.7 getpid</a></li>
</ul>

<H3><a name="taskcreate">2.1.1 task_create</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
   #include &lt;sched.h&gt;
   int task_create(char *name, int priority, int stack_size, main_t entry, const char *argv[]);
</pre>

<p>
<b>Description:</b> 
   This function creates and activates a new task with a
   specified priority and returns its system-assigned ID.
</p>

<p>The entry address entry is the address of the &quot;main&quot;
   function of the task.
   This function will be called once the C environment has been set up.
   The specified function will be called with four arguments.
   Should the specified routine return, a call to exit() will automatically be made.
</P>
<p>
   Note that an arbitrary number of arguments may be passed to the
   spawned functions.  The maximum umber of arguments is an OS
   configuration parameter (<code>CONFIG_MAX_TASK_ARGS</code>).
</p>
<p>
   The arguments are copied (via <code>strdup</code>) so that the
   life of the passed strings is not dependent on the life of the
   caller to <code>task_create()</code>.
</p>
<p>
   The newly created task does not inherit scheduler characteristics
   from the parent task:  The new task is started at the
   default system priority and with the SCHED_FIFO scheduling
   policy.  These characteristcs may be modified after the new
   task has been started.
</p>
<p>
   The newly created task does inherit the first three file
   descriptors (corresponding to stdin, stdout, and stderr) and
   redirection of standard I/O is supported.
</p>
<p>
<b>Input Parameters:</b> 
  <ul>
    <li><I>name</I>. Name of the new task</LI>
    <li><I>priority</I>. Priority of the new task</LI>
    <li><I>stack_size</I>. size (in bytes) of the stack needed</LI>
    <li><I>entry</I>. Entry point of a new task</LI>
    <li><I>argv</I>. A pointer to an array of input parameters.  Up to
       <code>CONFIG_MAX_TASK_ARG</code> parameters may be provided.
       If fewer than <code>CONFIG_MAX_TASK_ARG</code> parameters are
       passed, the list should be terminated with a NULL argv[] value.
       If no parameters are required, argv may be NULL.
  </ul>
<p>
  <b>Returned Values:</b> 
</P>
<ul>
<li>
  Returns the non-zero task ID of the new task or
  ERROR if memory is insufficient or the task cannot be
  created (errno is not set).
</LI>
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>POSIX Compatibility:</b> This is a NON-POSIX interface.
VxWorks provides the following similar interface:
<pre>
   int taskSpawn(char *name, int priority, int options, int stackSize, FUNCPTR entryPt,
                 int arg1, int arg2, int arg3, int arg4, int arg5,
                 int arg6, int arg7, int arg8, int arg9, int arg10);
</pre>

<p>
  The NuttX task_create() differs from VxWorks' taskSpawn() in the
  following ways:
</p>
<ul>
<li>Interface name
<li>Various differences in types of arguments
<li>There is no options arguement.
<li>A variable number of parameters can be passed to a task (VxWorks supports ten).
</ul>

<H3><a name="taskinit">2.1.2 task_init</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
   #include &lt;sched.h&gt;
   STATUS task_init(_TCB *tcb, char *name, int priority, uint32 *stack, uint32 stack_size,
                    maint_t entry, const char *argv[]);
</pre>

<p>
<b>Description:</b>
<p>
  This function initializes a Task Control Block (TCB)
  in preparation for starting a new thread.  It performs a subset
  of the functionality of <code>task_create()</code> (see above).
</P>
<p>
  Unlike task_create(), task_init() does not activate the task.
  This must be done by calling task_activate().
</P>
<p>
<b>Input Parameters:</b> 
  <ul>
    <li><I>tcb</I>. Address of the new task's TCB
    <li><I>name</I>. Name of the new task (not used)
    <li><I>priority</I>. Priority of the new task
    <li><I>stack</I>. Start of the pre-allocated stack
    <li><I>stack_size</I>. size (in bytes) of the pre-allocated stack
    <li><I>entry</I>. Entry point of a new task
    <li><I>argv</I>. A pointer to an array of input parameters.  Up to
       <code>CONFIG_MAX_TASK_ARG</code> parameters may be provided.
       If fewer than <code>CONFIG_MAX_TASK_ARG</code> parameters are
       passed, the list should be terminated with a NULL argv[] value.
       If no parameters are required, argv may be NULL.
  </ul>
</p>
<p>
<b>Returned Values:</b> 
</p>
<ul>
  <li><p>OK, or ERROR if the task cannot be initialized.</P>
  <p>This function can only failure is it is unable to assign
    a new, unique task ID to the TCB (errno is not set).</P>
</ul>
<p>
<b>Assumptions/Limitations:</b>
<ul>
<li>task_init() is provided to support internal OS functionality.  It is
<b>not recommended</b> for normal usage.  task_create() is the preferred
mechanism to initialize and start a new task.
</ul>
<p>
<b>POSIX Compatibility:</b> This is a NON-POSIX interface.
VxWorks provides the following similar interface:
<pre>
   STATUS taskInit(WIND_TCB *pTcb, char *name, int priority, int options, uint32 *pStackBase, int stackSize,
                   FUNCPTR entryPt, int arg1, int arg2, int arg3, int arg4, int arg5,
                   int arg6, int arg7, int arg8, int arg9, int arg10);
</pre>

<p>
  The NuttX task_init() differs from VxWorks' taskInit() in the
  following ways:
</p>
<ul>
<li>Interface name
<li>Various differences in types or arguments
<li>There is no options argument.
<li>A variable number of parameters can be passed to a task (VxWorks supports ten).
</ul>

<H3><a name="taskactivate">2.1.3 task_activate</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    STATUS task_activate( _TCB *tcb );
</pre>

<p>
<b>Description:</b> This function activates tasks created by task_init().
Without activation, a task is ineligible for execution by the
scheduler.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>tcb</I>. The TCB for the task for the task (same as the
task_init argument).
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>OK, or ERROR if the task cannot be activated (errno is not set).
</ul>

<p>
<b>Assumptions/Limitations:</b>
<ul>
<li>task_activate() is provided to support internal OS functionality.  It is
<b>not recommended</b> for normal usage.  task_create() is the preferred
mechanism to initialize and start a new task.
</ul>
<p>
<b>POSIX Compatibility:</b> This is a NON-POSIX interface.
VxWorks provides the following similar interface:
<pre>
    STATUS taskActivate( int tid );
</pre>

<p>
  The NuttX task_activate() differs from VxWorks' taskActivate() in the
  following ways:
</p>
<ul>
<li>Function name
<li>With VxWork's taskActivate, the pid argument is supposed to be
the pointer to the WIND_TCB cast to an integer.
</ul>

<H3><a name="taskdelete">2.1.4 task_delete</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    STATUS task_delete( pid_t pid );
</pre>

<p>
<b>Description:</b> This function causes a specified task to cease
to exist -- its stack and TCB will be deallocated. This function
is the companion to task_create().
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>pid</I>. The task ID of the task to delete. An ID of
zero signifies the calling task.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>OK, or ERROR if the task cannot be deleted.
This function can fail if the provided pid does not correspond to a task (errno is not set)
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
task_delete() must be used with caution:  If the task holds resources
(for example, allocated memory or semaphores needed by other tasks), then
task_delete() can strand those resources.
<p>
<b>POSIX Compatibility:</b> This is a NON-POSIX interface.
VxWorks provides the following similar interface:
<pre>
    STATUS taskDelete( int tid );
</pre>

<p>
  The NuttX task_delete() differs from VxWorks' taskDelete() in
  the following ways:
</p>
<ul>
<li>No support is provided for calling the tasks deletion routines
(because taskDeleteHookAdd() is not supported).
<li>Deletion of self is not supported.  Use _exit();
</ul>

<H3><a name="exit">2.1.5 exit</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    void exit( int code );

    #include &lt;nuttx/unistd.h&gt;
    void _exit( int code );
</pre>

<p>
<b>Description:</b> This function causes the calling task to cease
to exist -- its stack and TCB will be deallocated.  exit differs from
_exit in that it flushs streams, closes file descriptors and will
execute any function registered with atexit().
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>code</I>. (ignored)
</ul>

<p>
<b>Returned Values:</b>  None.

<p>
<b>Assumptions/Limitations:</b> 

<p>
<b>POSIX Compatibility:</b> This is equivalent to the ANSI interface:
<pre>
    void exit( int code );
</pre>
And the unix interface:
<pre>
    void _exit( int code );
</pre>

<p>
  The NuttX exit() differs from ANSI exit() in the following ways:
</p>
<ul>
<li>The <I>code</I> parameter is ignored.
</ul>

<H3><a name="taskrestart">2.1.6 task_restart</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    STATUS task_restart( pid_t pid );
</pre>

<p>
<b>Description:</b> This function &quot;restarts&quot; a task.
The task is first terminated and then reinitialized with same
ID, priority, original entry point, stack size, and parameters
it had when it was first started.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>pid</I>. The task ID of the task to delete. An ID of
zero signifies the calling task.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>
  OK, or ERROR if the task ID is invalid or the task could
  not be restarted.
  This function can fail if:
  (1) A pid of zero or the pid of the calling task is provided (functionality not implemented)
  (2) The pid is not associated with any task known to the system.
</LI>
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>POSIX Compatibility:</b> This is a NON-POSIX interface.
VxWorks provides the following similar interface:
<pre>
    STATUS taskRestart (int tid);
</pre>

<p>
  The NuttX task_restart() differs from VxWorks' taskRestart() in the following ways:
</p>
<ul>
<li>Restart of the currently running task is not supported.
<li>The VxWorks description says that the ID, priority, etc. take
the value that they had when the task was <I>terminated</I>.
</ul>

<H3><a name="getpid">2.1.7 getpid</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;unistd.h&gt;
    pid_t getpid( void );
</pre>

<p>
<b>Description:</b> This function returns the task ID of the
calling task. The task ID will be invalid if called at the interrupt
level.
<p>
<b>Input Parameters:</b> None.
<p>
<b>Returned Values:</b> 
<ul>
<li>The task ID of the calling task.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>POSIX Compatibility:</b>
Compatible with the POSIX interface of the same name.

<H2>2.2 <A NAME="Task_Schedule">Task Scheduling Interfaces</a></H2>

<p>
  By default, NuttX performs strict priority scheduling: Tasks of higher
  priority have exclusive access to the CPU until they become blocked.
  At that time, the CPU is available to tasks of lower priority.
  Tasks of equal priority are scheduled FIFO.
</p>
<p>
  Optionally, a Nuttx task or thread can be configured with round-robin
  scheduler.  This is similar to priority scheduling <i>except</i> that
  tasks with equal priority and share CPU time via <i>time-slicing</i>.
  The time-slice interval is a constant determined by the configuration
  setting <code>CONFIG_RR_INTERVAL</code>.
</p>
<p>
  The OS interfaces described in the following paragraphs provide
  a POSIX- compliant interface to the NuttX scheduler:
</p>
<ul>
  <li><a href="#schedsetparam">2.2.1 sched_setparam</a></li>
  <li><a href="#schedgetparam">2.2.2 sched_getparam</a></li>
  <li><a href="#schedsetscheduler">2.2.3 sched_setscheduler</a></li>
  <li><a href="#setgetscheduler">2.2.4 sched_getscheduler</a></li>
  <li><a href="#sched_yield">2.2.5 sched_yield</a></li>
  <li><a href="#schedgetprioritymax">2.2.6 sched_get_priority_max</a></li>
  <li><a href="#schedgetprioritymin">2.2.7 sched_get_priority_min</a></li>
  <li><a href="#schedgetrrinterval">2.2.8 sched_get_rr_interval</a></li>
</ul>

<H3><a name="schedsetparam">2.2.1 sched_setparam</a></H3>
<p>
  <b>Function Prototype:</b>
<pre>
    #include &lt;sched.h&gt;
    int sched_setparam(pid_t pid, const struct sched_param *param);
</pre>
<p>
  <b>Description:</b>
  This function sets the priority of the task specified by pid input parameter.
</p>
<p>
  NOTE: Setting a task's priority to the same value has the similar
  effect to <code>sched_yield()</code>: The task will be moved to after all
  other tasks with the same priority.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li>
    <code>pid</code>.
    The task ID of the task.
    If <code>pid</code> is zero, the priority of the calling task is set.
  </li>
  <li>
    <code>param</code>.
    A structure whose member <code>sched_priority</code> is the integer priority.
    The range of valid priority numbers is from <code>SCHED_PRIORITY_MIN</code> through <code>SCHED_PRIORITY_MAX</code>.
  </li>
</ul>
<p>
  <b>Returned Values:</b>
  On success, sched_setparam() returns 0 (OK).
  On error, -1 (ERROR) is returned, and errno is set appropriately.
</p>
<ul>

  <li>
    <code>EINVAL</code>.
     The parameter <code>param</code> is invalid or does not make sense for the current scheduling policy.
  </li>
  <li>
    <code>EPERM</code>.
    The calling task does not have appropriate privileges.
  </li>
  <li>
    <code>ESRCH</code>.
    The task whose ID is <code>pid</code> could not be found.
  </li>
</ul>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX  Compatibility:</b>
  Comparable to the POSIX interface of the same name.
  Differences from the full POSIX implementation include:
</p>
<ul>
  <li>The range of priority values for the POSIX call is 0 to 255.</li>
</ul>

<H3><a name="schedgetparam">2.2.2 sched_getparam</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    int sched_getparam (pid_t pid, struct sched_param *param);
</pre>

<p>
<b>Description:</b> This function gets the scheduling priority
of the task specified by pid.
<p>
<b>Input Parameters:</b> 
<ul>
<li>
  <code>pid</code>. The task ID of the task.
  If pid is zero, the priority of the calling task is returned.
</li>
<li>
  <code>param</code>.
  A structure whose member <code>sched_priority</code> is the integer priority.
   The task's priority is copied to the <code>sched_priority</code> element of this structure.
</li>
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK) if successful, otherwise -1 (ERROR).
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="schedsetscheduler">2.2.3 sched_setscheduler</a></H3>
<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    int sched_setscheduler (pid_t pid, int policy, const struct sched_param *param);
</pre>
<p>
  <b>Description:</b>
  <i>sched_setscheduler()</i>  sets both the scheduling policy
  and the priority for the task identified by pid.
  If pid equals zero, the scheduler of the calling
  thread will be set.
  The parameter 'param' holds the priority of the thread under the new policy.
</p>
<p>
<b>Input Parameters:</b> 
<ul>
  <li>
    <I>pid</I>. The task ID of the task. If pid is zero, the
    priority of the calling task is set.
  </li>
  <li>
    <I>policy</I>. Scheduling policy requested (either SCHED_FIFO or SCHED_RR).
  </li>
  <li>
    <code>param<code>. A structure whose member sched_priority is the
    integer priority. The range of valid priority numbers is from
    SCHED_PRIORITY_MIN through SCHED_PRIORITY_MAX.
  </li>
</ul>
<p>
  <b>Returned Values:</b> 
  On success, <i>sched_setscheduler()</i> returns OK (zero).  On
  error, ERROR (-1) is returned, and errno is set appropriately:
</p>
<ul>
  <li>EINVAL The scheduling policy is not one of the
    recognized policies.</li>
  <li>ESRCH  The task whose ID is pid could not be found.</li>
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="setgetscheduler">2.2.4 sched_getscheduler</a></H3>
<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    int sched_getscheduler (pid_t pid);
</pre>
<p>
  <b>Description:</b>
  <i>sched_getscheduler()</i> returns the scheduling policy
  currently applied to the task identified by pid. If
  pid equals zero, the policy of the calling process will
  be retrieved.
 *
 * Inputs:
 *
 * Return Value:

 This function returns the current scheduling
policy.
<p>
<b>Input Parameters:</b> 
<ul>
  <li><I>pid</I>.
    The task ID of the task to query.
    If pid is zero, the calling task is queried.
  </LI>
</ul>
<p>
<b>Returned Values:</b> 
<ul>
  <li>
    On success, <i>sched_getscheduler()</i> returns the policy for
    the task (either SCHED_FIFO or SCHED_RR).
    On error,  ERROR (-1) is returned, and errno is set appropriately:
    <ul>
      <li>ESRCH  The task whose ID is pid could not be found.</li>
    </ul>
  </li>
</ul>
<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.
Differences from the full POSIX implementation include:
<ul>
<li>Does not report errors via <I>errno</I>.
</ul>

<H3><a name="sched_yield">2.2.5 sched_yield</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    int sched_yield( void );
</pre>

<p>
<b>Description:</b> This function forces the calling task to give
up the CPU (only to other tasks at the same priority).
<p>
<b>Input Parameters:</b> None.
<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK) or -1 (ERROR)
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="schedgetprioritymax">2.2.6 sched_get_priority_max</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    int sched_get_priority_max (int policy)
</pre>

<p>
<b>Description:</b> This function returns the value of the highest
possible task priority for a specified scheduling policy.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>policy</I>. Scheduling policy requested.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>The maximum priority value or -1 (ERROR).
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="schedgetprioritymin">2.2.7 sched_get_priority_min</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    int sched_get_priority_min (int policy);
</pre>

<p>
<b>Description:</b> This function returns the value of the lowest
possible task priority for a specified scheduling policy.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>policy</I>. Scheduling policy requested.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>The minimum priority value or -1 (ERROR)
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="schedgetrrinterval">2.2.8 sched_get_rr_interval</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    int sched_get_rr_interval (pid_t pid, struct timespec *interval);
</pre>

<p>
  <b>Description:</b> 
  <i>sched_rr_get_interval()</i>  writes  the timeslice interval
  for task identified by <i>pid</i> into  the timespec structure
  pointed to by <i>interval</i>.  If pid is zero, the timeslice
  for the calling process is written into 'interval.  The
  identified process should be running under the SCHED_RR
  scheduling policy.'
</p>
<p>
  <b>Input Parameters:</b> 
</p>
<ul>
<li><I>pid</I>. The task ID of the task. If pid is zero, the
priority of the calling task is returned.
<li><I>interval</I>. A structure used to return the time slice.
</ul>

<p>
  <b>Returned Values:</b> 
  On success, sched_rr_get_interval() returns OK (0).  On
  error, ERROR (-1) is returned, and errno is set to:
</p>
<ul>
  <li>EFAULT Cannot copy to interval</LI>
  <li>EINVAL Invalid pid.</LI>
  <li>ENOSYS The system call is not yet implemented.</LI>
  <li>ESRCH  The process whose ID is pid could not be found.</LI>
</ul>

<p>
  <b>Assumptions/Limitations:</b> 
<p>
  <b>POSIX  Compatibility:</b> Comparable to the POSIX
  interface of the same name.
</P>

<H2>2.3 <A NAME="Task_Switch">Task Switching Interfaces</a></H2>

<ul>
  <li><a href="#schedlock">2.3.1 sched_lock</a></li>
  <li><a href="#schedunlock">2.3.2 sched_unlock</a></li>
  <li><a href="#schedlockcount">2.3.3 sched_lockcount</a></li>
</ul>

<H3><a name="schedlock">2.3.1 sched_lock</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    STATUS sched_lock( void );
</pre>

<p>
<b>Description:</b> This function disables context switching by
Disabling addition of new tasks to the ready-to-run task list.
The task that calls this function will be the only task that is
allowed to run until it either calls sched_unlock (the appropriate
number of times) or until it blocks itself.
<p>
<b>Input Parameters:</b> None.
<p>
<b>Returned Values:</b> 
<ul>
<li>OK or ERROR.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> This is a NON-POSIX interface.
VxWorks provides the comparable interface:
<pre>
    STATUS taskLock( void );
</pre>

<H3><a name="schedunlock">2.3.2 sched_unlock</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    STATUS sched_unlock( void );
</pre>

<p>
<b>Description:</b> This function decrements the preemption lock
count. Typically this is paired with sched_lock() and concludes
a critical section of code. Preemption will not be unlocked until
sched_unlock() has been called as many times as sched_lock().
When the lockCount is decremented to zero, any tasks that were
eligible to preempt the current task will execute.
<p>
<b>Input Parameters:</b> None.
<p>
<b>Returned Values:</b> 
<ul>
<li>OK or ERROR.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> This is a NON-POSIX interface.
VxWorks provides the comparable interface:
<pre>
    STATUS taskUnlock( void );
</pre>

<H3><a name="schedlockcount">2.3.3 sched_lockcount</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;sched.h&gt;
    sint32 sched_lockcount( void )
</pre>

<p>
<b>Description:</b> This function returns the current value of
the lockCount. If zero, preemption is enabled; if non-zero, this
value indicates the number of times that sched_lock() has been called
on this thread of execution.
<p>
<b>Input Parameters:</b> None.
<p>
<b>Returned Values:</b> 
<ul>
<li>The current value of the lockCount.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> None.
<hr>

<H2>2.4 <A NAME="Message_Queue">Named Message Queue Interfaces</a></H2>

<p>
  NuttX supports POSIX named message queues for intertask communication.
  Any task may send or receive messages on named message queues.
  Interrupt handlers may send messages via named message queues.
</p>
<ul>
  <li><a href="#mqopen">2.4.1 mq_open</a></li>
  <li><a href="#mqclose">2.4.2 mq_close</a></li>
  <li><a href="#mqunlink">2.4.3 mq_unlink</a></li>
  <li><a href="#mqsend">2.4.4 mq_send</a></li>
  <li><a href="#mqtimedsend">2.4.5 mq_timedsend</a></li>
  <li><a href="#mqreceive">2.4.6 mq_receive</a></li>
  <li><a href="#mqtimedreceive">2.4.7 mq_timedreceive</a></li>
  <li><a href="#mqnotify">2.4.8 mq_notify</a></li>
  <li><a href="#mqsetattr">2.4.9 mq_setattr</a></li>
  <li><a href="#mqgetattr">2.4.10 mq_getattr</a></li>
</ul>

<H3><a name="mqopen">2.4.1 mq_open</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;mqueue.h&gt;
    mqd_t mq_open( const char *mqName, int oflags, ... );
</pre>

<p>
<b>Description:</b> This function establish a connection between
a named message queue and the calling task. After a successful
call of mq_open(), the task can reference the message queue using
the address returned by the call. The message queue remains usable
until it is closed by a successful call to mq_close().
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>mqName</I>. Name of the queue to open
<li><I>oflags</I>. Open flags. These may be any combination of:
<ul>
<li><I>O_RDONLY</I>. Open for read access.
<li><I>O_WRONLY</I>. Open for write access.
<li><I>O_RDWR</I>. Open for both read &amp; write access.
<li><I>O_CREAT</I>. Create message queue if it does not already
exist.
<li><I>O_EXCL</I>. Name must not exist when opened.
<li><I>O_NONBLOCK</I>. Don't wait for data.
</ul>

<li><I>... Optional parameters</I>.
When the O_CREAT flag is specified, POSIX requires that a third
and fourth parameter be supplied:
<ul>
<li><I>mode</I>.  The mode parameter is of type mode_t.  In the POSIX
specification, this mode value provides file permission bits for the
message queue.  This parameter is required but not used in the present
implementation.
<li><I>attr</I>.  A pointer to an mq_attr that is provided to initialize.
the message queue.  If attr is NULL, then the messages queue is created
with implementation-defined default message queue attributes.  If attr is
non-NULL, then the message queue mq_maxmsg attribute is set to the
corresponding value when the queue is created.  The mq_maxmsg attribute
determines the maximum number of messages that can be queued before
addition attempts to send messages on the message queue fail or cause the
sender to block; the mq_msgsize attribute determines the maximum size of a
message that can be sent or received.  Other elements of attr are ignored
(i.e, set to default message queue attributes).
</ul>
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>A message queue descriptor or -1 (ERROR)
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX interface
of the same name.
Differences from the full POSIX implementation include:
<ul>
<li>The mq_msgsize attributes determines the maximum size of a message that
may be sent or received.  In the present implementation, this maximum
message size is limited at 22 bytes.
</ul>

<H3><a name="mqclose">2.4.2 mq_close</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;mqueue.h&gt;
    int mq_close( mqd_t mqdes );
</pre>

<p>
<b>Description:</b> This function is used to indicate that the
calling task is finished with the specified message queued mqdes.
The mq_close() deallocates any system resources allocated by the
system for use by this task for its message queue.
<p>
If the calling task has attached a notification request to the message
queue via this <I>mqdes</I> (see mq_notify()), this attachment will be
removed and the message queue is available for another task to attach
for notification.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>mqdes</I>. Message queue descriptor.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK) if the message queue is closed successfully, otherwise,
-1 (ERROR).
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<ul>
<li>The behavior of a task that is blocked on either a <code>mq_send()</code> or
<code>mq_receive()</code> is undefined when <code>mq_close()</code> is called.
<li>The result of using this message queue descriptor after successful
return from mq_close() is undefined.
</ul>
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX interface
of the same name.

<H3><a name="mqunlink">2.4.3 mq_unlink</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;mqueue.h&gt;
    int mq_unlink( const char *mqName );
</pre>

<p>
<b>Description:</b> This function removes the message queue named
by &quot;mqName.&quot; If one or more tasks have the message queue
open when mq_unlink() is called, removal of the message queue
is postponed until all references to the message queue have been
closed.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>mqName</I>. Name of the message queue
</ul>

<p>
<b>Returned Values:</b> None.
<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="mqsend">2.4.4 mq_send</a></H3>
<p>
<b>Function Prototype:</b> 
</p>
<pre>
    #include &lt;mqueue.h&gt;
    int mq_send(mqd_t mqdes, const void *msg, size_t msglen, int prio);
</pre>
<p>
<b>Description:</b>
  This function adds the specified message, <code>msg</code>,
  to the message queue, <code>mqdes</code>.
  The <code>msglen</code> parameter specifies the length of the message in bytes pointed to by <code>msg</code>.
  This length must not exceed the maximum message length from the <code>mq_getattr()</code>.
</p>
<p>
  If the message queue is not full, <code>mq_send()</code> will place the <code>msg</code>
  in the message queue at the position indicated by the <code>prio</code> argument.
  Messages with higher priority will be inserted before lower priority messages
  The value of <code>prio</code> must not exceed <code>MQ_PRIO_MAX</code>.
</p>
<p>
  If the specified message queue is full and <code>O_NONBLOCK</code> is not
  set in the message queue, then <code>mq_send()</code> will block until space
  becomes available to the queue the message.
</p>
<p>
  If the message queue is full and <code>NON_BLOCK</code> is set, the message
  is not queued and <code>ERROR</code> is returned.
</p>
<p>
  <b>Input Parameters:</b> 
</p>
<ul>
  <li><code>mqdes</code>. Message queue descriptor.</li>
  <li><code>msg</code>. Message to send.</li>
  <li><code>msglen</code>. The length of the message in bytes.</li>
  <li><code>prio</code>. The priority of the message.</li>
</ul>
<p>
  <b>Returned Values:</b>
  On success, <code>mq_send()</code> returns 0 (<code>OK</code>);
  on error, -1 (<code>ERROR</code>) is returned, with <code>errno</code> set
  to indicate the error:
</p>
<ul>
  <li>
    <code>EAGAIN</code>.
    The queue was empty, and the <code>O_NONBLOCK</code> flag was set for the message queue description referred to by <code>mqdes</code>.
  </li>
  <li>
    <code>EINVAL</code>.
    Either <code>msg</code> or <code>mqdes</code> is <code>NULL</code> or the value of <code>prio</code> is invalid.
  </li>
  <li>
    <code>EPERM</code>.
    Message queue opened not opened for writing.
  </li>
  <li>
    <code>EMSGSIZE</code>.
    <code>msglen</code> was greater than the <code>maxmsgsize</code> attribute of the message queue.
  </li>
  <li>
    <code>EINTR</code>.
    The call was interrupted by a signal handler.
  </li>
</ul>
<p>
  <b>Assumptions/Limitations:</b> 
</p>
<p>
  <b>POSIX  Compatibility:</b>
  Comparable to the POSIX interface of the same name.
</p>

<h3><a name="mqtimedsend">mq_timedsend</a></h3>
<b>Function Prototype:</b> 
</p>
<pre>
    #include &lt;mqueue.h&gt;
    int mq_timedsend(mqd_t mqdes, const char *msg, size_t msglen, int prio,
                     const struct timespec *abstime);
</pre>
<p>
<b>Description:</b>
  This function adds the specified message, <code>msg</code>,
  to the message queue, <code>mqdes</code>.
  The <code>msglen</code> parameter specifies the length of the message in bytes pointed to by <code>msg</code>.
  This length must not exceed the maximum message length from the <code>mq_getattr()</code>.
</p>
<p>
  If the message queue is not full, <code>mq_timedsend()</code> will place the <code>msg</code>
  in the message queue at the position indicated by the <code>prio</code> argument.
  Messages with higher priority will be inserted before lower priority messages
  The value of <code>prio</code> must not exceed <code>MQ_PRIO_MAX</code>.
</p>
<p>
  If the specified message queue is full and <code>O_NONBLOCK</code> is not
  set in the message queue, then <code>mq_send()</code> will block until space
  becomes available to the queue the message or until a timeout occurs.
</p>
<p>
  <code>mq_timedsend()</code> behaves just like <code>mq_send()</code>, except
  that if the queue is full and the <code>O_NONBLOCK</code> flag is not enabled
  for the message queue description, then <code>abstime</code> points to a
  structure which specifies a ceiling on the time for which the call will block.
  This ceiling is an absolute timeout in seconds and nanoseconds since the
  Epoch (midnight on the morning of 1 January 1970).
</p>
<p>
  If the message queue is full, and the timeout has already expired by the time
  of the call, <code>mq_timedsend()<code> returns immediately.
</p>
<p>
  <b>Input Parameters:</b> 
</p>
<ul>
  <li><code>mqdes</code>. Message queue descriptor.</li>
  <li><code>msg</code>. Message to send.</li>
  <li><code>msglen</code>. The length of the message in bytes.</li>
  <li><code>prio</code>. The priority of the message.</li>
</ul>
<p>
  <b>Returned Values:</b>
  On success, <code>mq_send()</code> returns 0 (<code>OK</code>);
  on error, -1 (<code>ERROR</code>) is returned, with <code>errno</code> set
  to indicate the error:
</p>
<ul>
  <li>
    <code>EAGAIN</code>.
    The queue was empty, and the <code>O_NONBLOCK</code> flag was set for the message queue description referred to by <code>mqdes</code>.
  </li>
  <li>
    <code>EINVAL</code>.
    Either <code>msg</code> or <code>mqdes</code> is <code>NULL</code> or the value of <code>prio</code> is invalid.
  </li>
  <li>
    <code>EPERM</code>.
    Message queue opened not opened for writing.
  </li>
  <li>
    <code>EMSGSIZE</code>.
    <code>msglen</code> was greater than the <code>maxmsgsize</code> attribute of the message queue.
  </li>
  <li>
    <code>EINTR</code>.
    The call was interrupted by a signal handler.
  </li>
</ul>
<p>
  <b>Assumptions/Limitations:</b> 
</p>
<p>
  <b>POSIX  Compatibility:</b>
  Comparable to the POSIX interface of the same name.
</p>

<h3><a name="mqreceive">2.4.5 mq_receive</a></h3>
<p>
  <b>Function Prototype:</b> 
</p>
<pre>
    #include &lt;mqueue.h&gt;
    ssize_t mq_receive(mqd_t mqdes, void *msg, size_t msglen, int *prio);
</pre>
<p>
  <b>Description:</b>
  This function receives the oldest of the highest priority messages from the message
  queue specified by <code>mqdes</code>.
  If the size of the buffer in bytes, <code>msgLen</code>, is less than the
  <code>mq_msgsize</code> attribute of the message queue, <code>mq_receive()</code> will
  return an error.
  Otherwise, the selected message is removed from the queue and copied to <code>msg</code>.
</p>
<p>
  If the message queue is empty and <code>O_NONBLOCK</code> was not set, <code>mq_receive()</code>
  will block until a message is added to the message queue.
  If more than one task is waiting to receive a message, only the task with the highest
  priority that has waited the longest will be unblocked.
</p>
<p>
  If the queue is empty and <code>O_NONBLOCK</code> is set, <code>ERROR</code> will be returned.
</p>
<p>
  <b>Input Parameters:</b> 
</p>
<ul>
  <li><code>mqdes</code>. Message Queue Descriptor.</li>
  <li><code>msg</code>. Buffer to receive the message.</li>
  <li><code>msglen</code>. Size of the buffer in bytes.</li>
  <li><code>prio</code>. If not NULL, the location to store message priority.
</ul>
<p>
  <b>Returned Values:</b>.
  One success, the length of the selected message in bytes is returned.
  On failure, -1 (<code>ERROR</code>) is returned and the <code>errno</code> is set appropriately:
</p>
<ul>
  <li>
    <code>EAGAIN</code>
    The queue was empty and the <code>O_NONBLOCK</code> flag was set for the message queue description referred to by <code>mqdes</code>.
  </li>
  <li>
    <code>EPERM</code>
    Message queue opened not opened for reading.
  </li>
  <li>
    <code>EMSGSIZE</code>
    <code>msglen</code> was less than the <code>maxmsgsize</code> attribute of the message queue.
  </li>
  <li>
    <code>EINTR</code>
    The call was interrupted by a signal handler.
  </li>
  <li>
    <code>EINVAL</code>
    Invalid <code>msg</code> or <code>mqdes</code>
  </li>
</ul>
<p>
  <b>Assumptions/Limitations:</b> 
</p>
<p>
  <b>POSIX  Compatibility:</b>
  Comparable to the POSIX interface of the same name.
</p>

<h3><a name="mqtimedreceive">2.4.6 mq_timedreceive</a></h3>
<p>
  <b>Function Prototype:</b> 
</p>
<pre>
    #include &lt;mqueue.h&gt;
    ssize_t mq_timedreceive(mqd_t mqdes, void *msg, size_t msglen,
                            int *prio, const struct timespec *abstime);
</pre>
<p>
  <b>Description:</b>
  This function receives the oldest of the highest priority messages from the message
  queue specified by <code>mqdes</code>.
  If the size of the buffer in bytes, <code>msgLen</code>, is less than the
  <code>mq_msgsize</code> attribute of the message queue, <code>mq_timedreceive()</code> will
  return an error.
  Otherwise, the selected message is removed from the queue and copied to <code>msg</code>.
</p>
<p>
  If the message queue is empty and <code>O_NONBLOCK</code> was not set, <code>mq_timedreceive()</code>
  will block until a message is added to the message queue (or until a timeout occurs).
  If more than one task is waiting to receive a message, only the task with the highest
  priority that has waited the longest will be unblocked.
</p>
<p>
  <code>mq_timedreceive()</code> behaves just like <code>mq_receive()<code>, except
  that if the queue is empty and the <code>O_NONBLOCK<c/ode> flag is not enabled
  for the message queue description, then <code>abstime</code> points to a structure
  which specifies a ceiling on the time for which the call will block.
  This ceiling is an absolute timeout in seconds and nanoseconds since the Epoch
  (midnight on the morning of 1 January 1970).
</p>
<p>
  If no message is available, and the timeout has already expired by the time of
  the call, <code>mq_timedreceive()</code> returns immediately.
</p>
<p>
  <b>Input Parameters:</b> 
</p>
<ul>
  <li><code>mqdes</code>. Message Queue Descriptor.</li>
  <li><code>msg</code>. Buffer to receive the message.</li>
  <li><code>msglen</code>. Size of the buffer in bytes.</li>
  <li><code>prio</code>. If not NULL, the location to store message priority.
  <li><code>abstime</code>. The absolute time to wait until a timeout is declared.
</ul>
<p>
  <b>Returned Values:</b>.
  One success, the length of the selected message in bytes is returned.
  On failure, -1 (<code>ERROR</code>) is returned and the <code>errno</code> is set appropriately:
</p>
<ul>
  <li>
    <code>EAGAIN</code>:
    The queue was empty and the <code>O_NONBLOCK</code> flag was set for the message queue description referred to by <code>mqdes</code>.
  </li>
  <li>
    <code>EPERM</code>:
    Message queue opened not opened for reading.
  </li>
  <li>
    <code>EMSGSIZE</code>:
    <code>msglen</code> was less than the <code>maxmsgsize</code> attribute of the message queue.
  </li>
  <li>
    <code>EINTR</code>:
    The call was interrupted by a signal handler.
  </li>
  <li>
    <code>EINVAL</code>:
    Invalid <code>msg</code> or <code>mqdes</code> or <code>abstime</code>
  </li>
  <li>
    <code>ETIMEDOUT</code>:
    The call timed out before a message could be transferred.
  </li>
</ul>
<p>
  <b>Assumptions/Limitations:</b> 
</p>
<p>
  <b>POSIX  Compatibility:</b>
  Comparable to the POSIX interface of the same name.
</p>

<h3><a name="mqnotify">2.4.7 mq_notify</a></h3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;mqueue.h&gt;
    int mq_notify(mqd_t mqdes, const struct sigevent *notification);
</pre>

<p>
<b>Description:</b> If the &quot;notification&quot; input parameter
is not NULL, this function connects the task with the message queue such
that the specified signal will be sent to the task whenever the message
changes from empty to non-empty. One notification can be attached
to a message queue.
<p>
If &quot;notification&quot; is NULL, the attached notification
is detached (if it was held by the calling task) and the queue
is available to attach another notification.
<p>
When the notification is sent to the registered task, its registration
will be removed.  The message queue will then be available for
registration.
<p>
<b>Input Parameters:</b>
<ul>
<li><I>mqdes</I>. Message queue descriptor
<li><I>notification</I>. Real-time signal structure containing:
<ul>
<li><I>sigev_notify</I>. Should be osSIGEV_SIGNAL (but actually
ignored)
<li><I>sigev_signo</I>. The signo to use for the notification
<li><I>sigev_value</I>. Value associated with the signal
</ul>

</ul>

<p>
<b>Returned Values:</b> None.
<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX interface
of the same name.
Differences from the full POSIX implementation include:
<ul>
<li>The notification signal will be sent to the registered task even if
another task is waiting for the message queue to become non-empty.  This is
inconsistent with the POSIX specification which states, &quot;If a process
has registered for notification of message arrival at a message queue and
some process is blocked in <I>mq_receive</I> waiting to receive a message
when a message arrives at the queue, the arriving message shall satisfy the
appropriate <I>mq_receive()</I> ... The resulting behavior is as if the
message queue remains empty, and no notification shall be sent.&quot;
</ul>

<H3><a name="mqsetattr">2.4.8 mq_setattr</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;mqueue.h&gt;
    int mq_setattr( mqd_t mqdes, const struct mq_attr *mqStat,
                     struct mq_attr *oldMqStat);
</pre>

<p>
<b>Description:</b> This function sets the attributes associated
with the specified message queue &quot;mqdes.&quot; Only the &quot;O_NONBLOCK&quot;
bit of the &quot;mq_flags&quot; can be changed.
<p>
If &quot;oldMqStat&quot; is non-null, mq_setattr() will store
the previous message queue attributes at that location (just as
would have been returned by mq_getattr()).
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>mqdes</I>. Message queue descriptor
<li><I>mqStat</I>. New attributes
<li><I>oldMqState</I>. Old attributes
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK) if attributes are set successfully, otherwise -1
(ERROR).
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="mqgetattr">2.4.9 mq_getattr</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;mqueue.h&gt;
    int mq_getattr( mqd_t mqdes, struct mq_attr *mqStat);
</pre>

<p>
<b>Description:</b> This functions gets status information and
attributes associated with the specified message queue.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>mqdes</I>. Message queue descriptor
<li><I>mqStat</I>. Buffer in which to return attributes. The returned
attributes include:
<ul>
<li><I>mq_maxmsg</I>. Max number of messages in queue.
<li><I>mq_msgsize</I>. Max message size.
<li><I>mq_flags</I>. Queue flags.
<li><I>mq_curmsgs</I>. Number of messages currently in queue.
</ul>

</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK) if attributes provided, -1 (ERROR) otherwise.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H2>2.5 <A NAME="Semaphores">Counting Semaphore Interfaces</a></H2>

<p>
  <b>Semaphores</b>.  Semaphores are the basis for
  synchronization and mutual exclusion in NuttX. NuttX supports
  POSIX semaphores.
</p>
<p>
  Semaphores are the preferred mechanism for gaining exclusive access to a
  resource.  sched_lock() and sched_unlock() can also be used for this purpose.
  However, sched_lock() and sched_unlock() have other undesirable side-affects
  in the operation of the system:  sched_lock() also prevents higher-priority
  tasks from running that do not depend upon the semaphore-managed resource
  and, as a result, can adversely affect system response times.
</p>
<p>
  <b>Priority Inversion</b>.  Proper use of semaphores avoids the issues of
  sched_lock().  However, consider the following example:
  <OL>
    <li>Some low-priority task, <I>Task C</I>, acquires a semphore in order to
      get exclusive access to a protected resource.</li>
    <li><I>Task C</I> is suspended to allow some high-priority task,</li>
      <I>Task A</I>, to execute.</li>
    <li><I>Task A</I> attempts to acquire the semaphore held by <I>Task C</I> and
      gets blocked until <I>Task C</I> relinquishes the semaphore.</li>
    <li><I>Task C</I> is allowed to execute again, but gets suspended by some
      medium-priority <I>Task B</I>.</li>
  </OL>
<p>
  At this point, the high-priority <I>Task A</I> cannot execute until
  <I>Task B</I> (and possibly other medium-priority tasks) completes and until
  <I>Task C</I> relinquishes the semaphore.  In effect, the high-priority task,
  <I>Task A</I> behaves as though it were lower in priority than the
  low-priority task, <I>Task C</I>!  This phenomenon is called <I>priority
  inversion</I>.
</p>
<p>
  Some operating systems avoid priority inversion by <I>automatically</I>
  increasing the priority of the low-priority <I>Task C</I> (the operable
  buzz-word for this behavior is <I>priority inheritance</I>).  NuttX does not
  support this behavior.  As a consequence, it is left to the designer to
  provide implementations that will not suffer from priority inversion.
  The designer may, as examples:
</p>
<ul>
  <li>Implement all tasks that need the semphore-managed resources at the
    same priority level,</li>
  <li>Boost the priority of the low-priority task before the semaphore is
    acquired, or</li>
  <li>Use sched_lock() in the low-priority task.</li>
</ul>
<p>
  POSIX semaphore interfaces:
</p>
<ul>
  <li><a href="#seminit">2.5.1 sem_init</a></li>
  <li><a href="#semdestroy">2.5.2 sem_destroy</a></li>
  <li><a href="#semopen">2.5.3 sem_open</a></li>
  <li><a href="#semclose">2.5.4 sem_close</a></li>
  <li><a href="#semunlink">2.5.5 sem_unlink</a></li>
  <li><a href="#semwait">2.5.6 sem_wait</a></li>
  <li><a href="#semtrywait">2.5.7 sem_trywait</a></li>
  <li><a href="#sempost">2.5.8 sem_post</a></li>
  <li><a href="#semgetvalue">2.5.9 sem_getvalue</a></li>
</ul>

<H3><a name="seminit">2.5.1 sem_init</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;semaphore.h&gt;
    int sem_init ( sem_t *sem, int pshared, unsigned int value );
</pre>

<p>
<b>Description:</b> This function initializes the UN-NAMED semaphore
sem. Following a successful call to sem_init(), the semaphore
may be used in subsequent calls to sem_wait(), sem_post(), and
sem_trywait(). The semaphore remains usable until it is destroyed.
<p>
Only <I>sem</I> itself may be used for performing synchronization.  The
result of referring to copies of <I>sem</I> in calls to <I>sem_wait()</I>,
<I>sem_trywait()</I>, <I>sem_post()</I>, and <I>sem_destroy()</I>, is
not defined.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>sem</I>. Semaphore to be initialized
<li><I>pshared</I>. Process sharing (not used)
<li><I>value</I>. Semaphore initialization value 
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK), or -1 (ERROR) if unsuccessful.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.
Differences from the full POSIX implementation include:
<ul>
<li>pshared is not used.
</ul>

<H3><a name="semdestroy">2.5.2 sem_destroy</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;semaphore.h&gt;
    int sem_destroy ( sem_t *sem );
</pre>

<p>
<b>Description:</b> This function is used to destroy the un-named semaphore
indicated by <I>sem</I>.  Only a semaphore that was created using
<I>sem_init()</I> may be destroyed using <I>sem_destroy()</I>.  The effect
of calling <I>sem_destroy()</I> with a named semaphore is undefined.  The
effect of subsequent use of the semaphore <I>sem</I> is undefined until
<I>sem</I> is re-initialized by another call to <I>sem_init()</I>.
<p>
The effect of destroying a semaphore upon which other tasks are currently
blocked is undefined.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>sem</I>. Semaphore to be destroyed.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK), or -1 (ERROR) if unsuccessful.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="semopen">2.5.3 sem_open</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;semaphore.h&gt;
    sem_t *sem_open ( const char *name, int oflag, ...);
</pre>

<p>
<b>Description:</b> This function establishes a connection between
named semaphores and a task. Following a call to sem_open() with
the semaphore name, the task may reference the semaphore associated
with name using the address returned by this call. The semaphore
may be used in subsequent calls to sem_wait(), sem_trywait(),
and sem_post(). The semaphore remains usable until the semaphore
is closed by a successful call to sem_close().
<p>
If a task makes multiple calls to sem_open() with the same name,
then the same semaphore address is returned (provided there have
been no calls to sem_unlink()).
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>name</I>. Semaphore name
<li><I>oflag</I>. Semaphore creation options. This may one of
the following bit settings:
<ul>
<li><I>oflag</I> = 0: Connect to the semaphore only if it already
exists.
<li><I>oflag</I> = O_CREAT: Connect to the semaphore if it exists,
otherwise create the semaphore.
<li><I>oflag</I> = O_CREAT with O_EXCL (O_CREAT|O_EXCL): Create
a new semaphore unless one of this name already exists.
</ul>
<li>... Optional parameters.
NOTE:  When the O_CREAT flag is specified, POSIX requires that a third
and fourth parameter be supplied:
<ul>
<li><I>mode</I>.  The mode parameter is of type mode_t.  
This parameter is required but not used in the present
implementation.
<li><I>value</I>.  The value parameter is type unsigned int.  The semaphore
is created with an initial value of <I>value</I>.  Valid initial values for
semaphores must be less than or equal to <I>SEM_VALUE_MAX</I> (defined in
<CODE>include/limits.h</CODE>).
</ul>
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>A pointer to sem_t or -1 (ERROR) if unsuccessful.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.
Differences from the full POSIX implementation include:
<ul>
<li>Treatment of links/connections is highly simplified. It is
just a counting semaphore.
</ul>

<H3><a name="semclose">2.5.4 sem_close</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;semaphore.h&gt;
    int sem_close ( sem_t *sem );
</pre>

<p>
<b>Description:</b> This function is called to indicate that the
calling task is finished with the specified named semaphore, sem.
The sem_close() deallocates any system resources allocated by
the system for this named semaphore.
<p>
If the semaphore has not been removed with a call to sem_unlink(),
then sem_close() has no effect on the named semaphore. However,
when the named semaphore has been fully unlinked, the semaphore
will vanish when the last task closes it.
<p>
Care must be taken to avoid risking the deletion of a semaphore
that another calling task has already locked.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>sem</I>. Semaphore descriptor
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK), or -1 (ERROR) if unsuccessful.
</ul>

<p>
<b>Assumptions/Limitations:</b>
<ul>
<li>Care must be taken to avoid deletion of a semaphore that another task
has already locked.
<li>sem_close() must not be called with an un-named semaphore.
</ul>
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="semunlink">2.5.5 sem_unlink</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;semaphore.h&gt;
    int sem_unlink ( const char *name );
</pre>

<p>
<b>Description:</b> This function will remove the semaphore named by the
input name parameter.  If one or more tasks have the semaphore named by
name oepn when sem_unlink() is called, destruction of the semaphore will
be postponed until all references have been destroyed by calls to
sem_close().
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>name</I>. Semaphore name
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK), or -1 (ERROR) if unsuccessful.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<ul>
<li>Care must be taken to avoid deletion of a semaphore that another task
has already locked.
<li>sem_unlink() must not be called with an un-named semaphore.
</ul>
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.
Differences from the full POSIX implementation include:
<ul>
<li>Treatment of links/connections is highly simplified. It is
just a counting semaphore.
<li>Calls to sem_open() to re-create or re-connect to the semaphore may
refer to the same semaphore; POSIX specifies that a new semaphore with the
same name should be created after sem_unlink() is called.
</ul>

<H3><a name="semwait">2.5.6 sem_wait</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;semaphore.h&gt;
    int sem_wait ( sem_t *sem );
</pre>

<p>
<b>Description:</b> This function attempts to lock the semaphore
referenced by sem. If the semaphore as already locked by another
task, the calling task will not return until it either successfully acquires
the lock or the call is interrupted by a signal.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>sem</I>. Semaphore descriptor.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK), or -1 (ERROR) is unsuccessful
</ul>
<p>
If <I>sem_wait</I> returns -1 (ERROR) then the cause of the failure
will be indicated by the thread-specific <I>errno</I> value (a pointer
to this value can be obtained using <I>get_errno_ptr()</I>).  The following
lists the possible values for <I>errno</I>:
<p>
<ul>
<li><I>EINVAL</I>:  Indicates that the <I>sem</I> input parameter is
not valid.
<li><I>EINTR</I>:  Indicates that the wait was interrupt by a signal
received by this task.  In this case, the semaphore has not be acquired.
</ul>
<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="semtrywait">2.5.7 sem_trywait</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;semaphore.h&gt;
    int sem_trywait ( sem_t *sem );
</pre>

<p>
<b>Description:</b> This function locks the specified semaphore
only if the semaphore is currently not locked.  In any event, the call
returns without blocking.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>sem</I>. The semaphore descriptor
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK) or -1 (ERROR) if unsuccessful
</ul>
If <I>sem_wait</I> returns -1 (ERROR) then the cause of the failure
will be indicated by the thread-specific <I>errno</I> value (a pointer
to this value can be obtained using <I>get_errno_ptr()</I>).  The following
lists the possible values for <I>errno</I>:
<p>
<ul>
<li><I>EINVAL</I>:  Indicates that the <I>sem</I> input parameter is
not valid.
<li><I>EAGAIN</I>:  Indicates that the semaphore was not acquired.
</ul>
<p>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="sempost">2.5.8 sem_post</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;semaphore.h&gt;
    int sem_post ( sem_t *sem );
</pre>

<p>
<b>Description:</b> When a task has finished with a semaphore,
it will call sem_post().  This function unlocks the semaphore referenced
by <I>sem</I> by performing the semaphore unlock operation.
<p>
If the semaphore value resulting from this operation is positive, then
no tasks were blocked waiting for the semaphore to become unlocked;
The semaphore value is simply incremented.
<p>
If the value of the semaphore resulting from this operation is zero, then
on of the tasks blocked waiting for the semaphore will be allowed to
return successfully from its call to <I>sem_wait()</I>.
<p>
<b>NOTE</b>:  <I>sem_post()</I> may be called from an interrupt handler.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>sem</I>. Semaphore descriptor
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK) or -1 (ERROR) if unsuccessful.
</ul>

<p>
<b>Assumptions/Limitations:</b> This function cannot be called
from an interrupt handler. It assumes the currently executing
task is the one that is performing the unlock.
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="semgetvalue">2.5.9 sem_getvalue</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;semaphore.h&gt;
    int sem_getvalue ( sem_t *sem, int *sval );
</pre>

<p>
<b>Description:</b> This function updates the location referenced
by sval argument to have the value of the semaphore referenced
by sem without effecting the state of the semaphore. The updated
value represents the actual semaphore value that occurred at some
unspecified time during the call, but may not reflect the actual
value of the semaphore when it is returned to the calling task.
<p>
If sem is locked, the value return by sem_getvalue() will either
be zero or a negative number whose absolute value represents the
number of tasks waiting for the semaphore.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>sem</I>. Semaphore descriptor
<li><I>sval</I>. Buffer by which the value is returned
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK) or -1 (ERROR) if unsuccessful.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<hr>

<H2>2.6 <A NAME="Watchdogs">Watchdog Timer Interfaces</a></H2>

<p>
  NuttX provides a general watchdog timer facility.
  This facility allows the NuttX user to specify a watchdog timer function
  that will run after a specified delay.
  The watchdog timer function will run in the context of the timer interrupt handler.
  Because of this, a limited number of NuttX interfaces are available to he watchdog timer function.
  However, the watchdog timer function may use <code>mq_send()</code>, <code>sigqueue()</code>,
  or <code>kill()</code> to communicate with NuttX tasks.
</p>
<ul>
  <li><a href="#wdcreate">2.6.1 wd_create</a></li>
  <li><a href="#wddelete">2.6.2 wd_delete</a></li>
  <li><a href="#wdstart">2.6.3 wd_start</a></li>
  <li><a href="#wdcancel">2.6.4 wd_cancel</a></li>
  <li><a href="#wdgettime">2.6.5 wd_gettime</a></li>
</ul>

<H3><a name="wdcreate">2.6.1 wd_create</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;wdog.h&gt;
    WDOG_ID wd_create (void);
</pre>

<p>
<b>Description:</b> The wd_create function will create a watchdog
by allocating the appropriate resources for the watchdog.
<p>
<b>Input Parameters:</b> None.
<p>
<b>Returned Values:</b> 
<ul>
<li>Pointer to watchdog that may be used as a handle in subsequent
NuttX calls (i.e., the watchdog ID), or NULL if insufficient resources
are available to create the watchdogs.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> This is a NON-POSIX interface.
VxWorks provides the following comparable interface:
<pre>
    WDOG_ID wdCreate (void);
</pre>

<p>
Differences from the VxWorks interface include:
<ul>
<li>The number of available watchdogs is fixed (configured at
initialization time).
</ul>

<H3><a name="wddelete">2.6.2 wd_delete</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;wdog.h&gt;
    STATUS wd_delete (WDOG_ID wdog);
</pre>

<p>
<b>Description:</b> The wd_delete function will deallocate a
watchdog. The watchdog will be removed from the timer queue if
has been started.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>wdog</I>. The watchdog ID to delete. This is actually a
pointer to a watchdog structure.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>OK or ERROR
</ul>

<p>
<b>Assumptions/Limitations:</b> It is the responsibility of the
caller to assure that the watchdog is inactive before deleting
it.
<p>
<b>  POSIX  Compatibility:</b> This is a NON-POSIX interface.
VxWorks provides the following comparable interface:
<pre>
    STATUS wdDelete (WDOG_ID wdog);
</pre>

<p>
Differences from the VxWorks interface include:
<ul>
<li>Does not make any checks to see if the watchdog is being used
before de-allocating it (i.e., never returns ERROR).
</ul>

<H3><a name="wdstart">2.6.3 wd_start</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;wdog.h&gt;
    STATUS wd_start( WDOG_ID wdog, int delay, wdentry_t wdentry,
                     intt argc, ....);
</pre>

<p>
<b>Description:</b> This function adds a watchdog to the timer
queue. The specified watchdog function will be called from the
interrupt level after the specified number of ticks has elapsed.
Watchdog timers may be started from the interrupt level.
<p>
Watchdog times execute in the context of the timer interrupt handler, but
with the PIC/PID address environment that was in place when wd_start()
was called.
<p>
Watchdog timers execute only once.
<p>
To replace either the timeout delay or the function to be executed,
call wd_start again with the same wdog; only the most recent
wd_start() on a given watchdog ID has any effect.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>wdog</I>. Watchdog ID
<li><I>delay</I>. Delay count in clock ticks
<li><I>wdentry</I>. Function to call on timeout
<li><I>argc</I>.  The number of uint32 parameters to pass to wdentry.
<li><I>...</I>. uint32 size parameters to pass to wdentry
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>OK or ERROR
</ul>

<p>
<b>Assumptions/Limitations:</b> The watchdog routine runs in the
context of the timer interrupt handler and is subject to all ISR
restrictions.
<p>
<b>  POSIX  Compatibility:</b> This is a NON-POSIX interface.
VxWorks provides the following comparable interface:
<pre>
    STATUS wdStart (WDOG_ID wdog, int delay, FUNCPTR wdentry, int parameter);
</pre>

<p>
Differences from the VxWorks interface include:
<ul>
<li>The present implementation supports multiple parameters passed
to wdentry; VxWorks supports only a single parameter.  The maximum
number of parameters is determined by 
</ul>

<H3><a name="wdcancel">2.6.4 wd_cancel</a></H3>
<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;wdog.h&gt;
    STATUS wd_cancel (WDOG_ID wdog);
</pre>

<p>
<b>Description:</b> This function cancels a currently running
watchdog timer. Watchdog timers may be canceled from the interrupt
level.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>wdog</I>. ID of the watchdog to cancel.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>OK or ERROR
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> This is a NON-POSIX interface.
VxWorks provides the following comparable interface:
<pre>
    STATUS wdCancel (WDOG_ID wdog);
</pre>

<h3><a name="wdgettime">2.6.5 wd_gettime</a></h3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;wdog.h&gt;
    Sint wd_gettime(WDOG_ID wdog);
</pre>
<p>
  <b>Description:</b> 
   This function returns the time remaining before the the specified watchdog expires.
</p>
<p>
  <b>Input Parameters:</b>
  <ul>
    <li><code>wdog</code>. Identifies the watchdog that the request is for.</li>
  </ul>
</p>
<p>
  <b>Returned Value:</b> 
  The time in system ticks remaining until the watchdog time expires.  Zero
  means either that wdog is not valid or that the wdog has already expired.
</p>

<hr>

<H2><A NAME="ClocksNTimers">2.7 Clocks and Timers</a></H2>
<ul>
  <li><a href="#clocksettime">2.7.1 clock_settime</a></li>
  <li><a href="#clockgettime">2.7.2 clock_gettime</a></li>
  <li><a href="#clockgetres">2.7.3 clock_getres</a></li>
  <li><a href="#mktime">2.7.4 mktime</a></li>
  <li><a href="#gmtimer">2.7.5 gmtime_r</a></li>
  <li><a href="#localtimer">2.7.6 localtime_r</a></li>
  <li><a href="#timercreate">2.7.7 timer_create</a></li>
  <li><a href="#timerdelete">2.7.8 timer_delete</a></li>
  <li><a href="#timersettime">2.7.9 timer_settime</a></li>
  <li><a href="#timergettime">2.7.10 timer_gettime</a></li>
  <li><a href="#timergetoverrun">2.7.11 timer_getoverrun</a></li>
</ul>

<H3><a name="clocksettime">2.7.1 clock_settime</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;time.h&gt;
    int clock_settime(clockid_t clockid, const struct timespec *tp);
</pre>
<p>
  <b>Description:</b>
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li><code>parm</code>. </li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  If successful, the <I>clock_settime()</I> function will return zero (<I>OK</I>).
  Otherwise, an non-zero error number will be returned to indicate the error:
</p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>

<H3><a name="clockgettime">2.7.2 clock_gettime</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;time.h&gt;
    int clock_gettime(clockid_t clockid, struct timespec *tp);
</pre>
<p>
  <b>Description:</b>
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li><code>parm</code>. </li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  If successful, the <I>clock_gettime()</I> function will return zero (<I>OK</I>).
  Otherwise, an non-zero error number will be returned to indicate the error:
</p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>

<H3><a name="clockgetres">2.7.3 clock_getres</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;time.h&gt;
    int clock_getres(clockid_t clockid, struct timespec *res);
</pre>
<p>
  <b>Description:</b>
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li><code>parm</code>. </li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  If successful, the <I>clock_getres()</I> function will return zero (<I>OK</I>).
  Otherwise, an non-zero error number will be returned to indicate the error:
</p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>

<H3><a name="mktime">2.7.4 mktime</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;time.h&gt;
    time_t mktime(struct tm *tp);
</pre>
<p>
  <b>Description:</b>
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li><code>parm</code>. </li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  If successful, the <I>mktime()</I> function will return zero (<I>OK</I>).
  Otherwise, an non-zero error number will be returned to indicate the error:
</p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>

<H3><a name="gmtimer">2.7.5 gmtime_r</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;time.h&gt;
    struct tm *gmtime_r(const time_t *clock, struct tm *result);
</pre>
<p>
  <b>Description:</b>
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li><code>parm</code>. </li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  If successful, the <I>gmtime_r()</I> function will return zero (<I>OK</I>).
  Otherwise, an non-zero error number will be returned to indicate the error:
</p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>

<H3><a name="localtimer">2.7.6 localtime_r</a></H3>
<pre>
    #include &lt;time.h&gt;
    #define localtime_r(c,r) gmtime_r(c,r)
</pre>

<H3><a name="timercreate">2.7.7 timer_create</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;time.h&gt;
    int timer_create(clockid_t clockid, struct sigevent *evp, timer_t *timerid);
</pre>
<p>
  <b>Description:</b>
  The  <code>timer_create()</code> function creates per-thread timer using the specified
  clock, <code>clock_id</code>, as the timing base.
  The <code>timer_create()</code> function returns, in
  the location referenced by <code>timerid</code>, a timer ID of type timer_t used to identify
  the timer in timer requests.
  This timer ID is unique until the timer is deleted.
  The particular clock, <code>clock_id<code>, is defined in <code>&lt;time.h&gt;<code>.
  The timer whose ID is returned will be in a disarmed state upon return from
  <code>timer_create()</code>.
</p>
<p>
  The <code>evp</code> argument, if non-NULL, points to a <code>sigevent</code> structure.
  This structure is allocated by the called and defines the asynchronous notification to occur.
  If the <code>evp</code> argument is NULL, the effect is as if the <code>evp</code> argument pointed to
  a <code>sigevent</code> structure with the <code>sigev_notify</code> member having the value <code>SIGEV_SIGNAL</code>,
  the <code>sigev_signo</code> having a default signal number, and the <code>sigev_value</code> member
  having the value of the timer ID.
</p>
<p>
  Each implementation defines a set of clocks that can be used as timing bases
  for per-thread timers. All implementations shall support a <code>clock_id</code> of
  <code>CLOCK_REALTIME</code>.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li><code>clockid</code>. Specifies the clock to use as the timing base.
    Must be <code>CLOCK_REALTIME</code>.</li>
  <li><code>evp</code>. Refers to a user allocated sigevent structure that defines the
    asynchronous notification.  evp may be NULL (see above).</li>
  <li><code>timerid</code>. The pre-thread timer created by the call to timer_create().</li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  If the call succeeds, <code>timer_create()</code> will return 0 (<code>OK</code>) and update the
  location referenced by <code>timerid</code> to a <code>timer_t</code>, which can be passed to the
  other per-thread timer calls.  If an error occurs, the function will return
  a value of -1 (<code>ERROR</code>) and set errno to indicate the error.
</p>
<ul>
  <li><code>EAGAIN</code>. The system lacks sufficient signal queuing resources to honor the
    request.</li>
  <li><code>EAGAIN</code>. The calling process has already created all of the timers it is
    allowed by this implementation.</li>
  <li><code>EINVAL</code>. The specified clock ID is not defined.</li>
  <li><code>ENOTSUP</code>. The implementation does not support the creation of a timer attached
    to the CPU-time clock that is specified by clock_id and associated with a
    thread different thread invoking timer_create().</li>
</ul>
<p>
  <b>POSIX Compatibility:</b>
  Comparable to the POSIX interface of the same name. Differences from the full POSIX implementation include:
</p>
<ul>
  <li>Only <code>CLOCK_REALTIME</code> is supported for the <code>clockid</code> argument.</li>
</ul>

<H3><a name="timerdelete">2.7.8 timer_delete</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;time.h&gt;
    int timer_delete(timer_t timerid);
</pre>
<p>
  <b>Description:</b>
  The <code>timer_delete()</code> function deletes the specified timer, <code>timerid</code>, previously
  created by the <code>timer_create()</code> function.
  If the timer is armed when <code>timer_delete()</code> is called, the timer will be automatically disarmed before
  removal.
  The disposition of pending signals for the deleted timer is unspecified.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li><code>timerid</code>.
  The pre-thread timer, previously created by the call to timer_create(), to be deleted.</li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  If successful, the <I>timer_delete()</I> function will return zero (<I>OK</I>).
  Otherwise, the function will return a value of -1 (ERROR) and set errno to indicate the error:
</p>
<ul>
  <li><code>EINVAL</code>. The timer specified timerid is not valid.</li>
</ul>
<p>
  <b>POSIX Compatibility:</b>
  Comparable to the POSIX interface of the same name.
</p>

<H3><a name="timersettime">2.7.9 timer_settime</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;time.h&gt;
    int timer_settime(timer_t timerid, int flags, const struct itimerspec *value,
                      struct itimerspec *ovalue);
</pre>
<p>
  <b>Description:</b>
  The <code>timer_settime()</code> function sets the time until the next expiration of the
  timer specified by <code>timerid</code> from the <code>it_value</code> member of the value argument
  and arm the timer if the <code>it_value</code> member of value is non-zero. If the
  specified timer was already armed when <code>timer_settime()</code> is called, this call
  will reset the time until next expiration to the value specified. If the
  <code>it_value</code> member of value is zero, the timer will be disarmed. The effect
  of disarming or resetting a timer with pending expiration notifications is
  unspecified.
</p>
<p>
  If the flag <code>TIMER_ABSTIME</code> is not set in the argument flags, <code>timer_settime()</code>
  will behave as if the time until next expiration is set to be equal to the
  interval specified by the <code>it_value</code> member of value. That is, the timer will
  expire in <code>it_value</code> nanoseconds from when the call is made. If the flag
  <code>TIMER_ABSTIME</code> is set in the argument flags, <code>timer_settime()</code> will behave as
  if the time until next expiration is set to be equal to the difference between
  the absolute time specified by the <code>it_value</code> member of value and the current
  value of the clock associated with <code>timerid</code>.  That is, the timer will expire
  when the clock reaches the value specified by the <code>it_value</code> member of value.
  If the specified time has already passed, the function will succeed and the
  expiration notification will be made.
</p>
<p>
  The reload value of the timer will be set to the value specified by the
  <code>it_interval</code> member of value.  When a timer is armed with a non-zero
  <code>it_interval</code>, a periodic (or repetitive) timer is specified.
</p>
<p>
  Time values that are between two consecutive non-negative integer multiples
  of the resolution of the specified timer will be rounded up to the larger
  multiple of the resolution. Quantization error will not cause the timer to
  expire earlier than the rounded time value.
</p>
<p>
  If the argument <code>ovalue</code> is not NULL, the t<code>imer_settime()</code> function will store,
  in the location referenced by <code>ovalue</code>, a value representing the previous
  amount of time before the timer would have expired, or zero if the timer was
  disarmed, together with the previous timer reload value. Timers will not
  expire before their scheduled time.
</p>
  <b>NOTE:</b>At present, the <code>ovalue</code> argument is ignored.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
 <li><code>timerid</code>. The pre-thread timer, previously created by the call to timer_create(), to be be set.</li>
 <li><code>flags</code>. Specifie characteristics of the timer (see above)</li>
 <li><code>value</code>. Specifies the timer value to set</li>
 <li><code>ovalue</code>. A location in which to return the time remaining from the previous timer setting (ignored).</li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  If the timer_gettime() succeeds, a value of 0 (OK) will be returned.
  If an error occurs, the value -1 (ERROR) will be returned, and errno set to indicate the error.
</p>
<ul>
  <li><code>EINVAL</code>. The timerid argument does not correspond to an ID returned by timer_create() but not yet deleted by timer_delete().</li>
  <li><code>EINVAL</code>. A value structure specified a nanosecond value less than zero or greater than or equal to 1000 million,
    and the it_value member of that structure did not specify zero seconds and nanoseconds.</li>
</ul>
<p>
  <b>POSIX Compatibility:</b>
  Comparable to the POSIX interface of the same name. Differences from the full POSIX implementation include:
</p>
<ul>
  <li>The <code>ovalue</code> argument is ignored.</li>
</ul>

<H3><a name="timergettime">2.7.10 timer_gettime</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;time.h&gt;
    int timer_gettime(timer_t timerid, struct itimerspec *value);
</pre>
<p>
  <b>Description:</b>
  The <code>timer_gettime()</code> function will store the amount of time until the
  specified timer, <code>timerid</code>, expires and the reload value of the timer into the
  space pointed to by the <code>value</code> argument. The <code>it_value</code> member of this structure
  will contain the amount of time before the timer expires, or zero if the timer
  is disarmed. This value is returned as the interval until timer expiration,
  even if the timer was armed with absolute time. The <code>it_interval</code> member of
  <code>value</code> will contain the reload value last set by <code>timer_settime()</code>.
</p>
<p>
   Due to the asynchronous operation of this function, the time reported
   by this function could be significantly more than that actual time
   remaining on the timer at any time.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
 <li><code>timerid</code>. Specifies pre-thread timer, previously created by the call to
 t<code>imer_create()</code>, whose remaining count will be returned.</li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  If successful, the <I>timer_gettime()</I> function will return zero (<I>OK</I>).
  Otherwise, an non-zero error number will be returned to indicate the error:
</p>
<ul>
  <li><code>EINVAL</code>.
  The <code>timerid</code> argument does not correspond to an ID returned by
  <code>timer_create()</code> but not yet deleted by <code>timer_delete()</code>.</li>
</ul>
<p>
  <b>POSIX Compatibility:</b>
  Comparable to the POSIX interface of the same name.
</p>

<H3><a name="timergetoverrun">2.7.11 timer_getoverrun</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;time.h&gt;
    int timer_getoverrun(timer_t timerid);
</pre>
<p>
  <b>Description:</b>
  Only a single signal will be queued to the process for a given timer at any
  point in time.  When a timer for which a signal is still pending expires, no
  signal will be queued, and a timer overrun will occur. When a timer
  expiration signal is delivered to or accepted by a process, if the
  implementation  supports  the  <i>Realtime Signals Extension</i>, the
  <code>timer_getoverrun()</code> function will return the timer expiration overrun count for
  the specified timer. The overrun count returned contains the number of extra
  timer expirations that occurred between the time the signal was generated
  (queued) and when it was delivered or accepted, up to but not including an 
  implementation-defined  maximum of <code>DELAYTIMER_MAX</code>. If the number of such
  extra expirations is greater than or equal to <code>DELAYTIMER_MAX</code>, then the
  overrun count will be set to <code>DELAYTIMER_MAX</code>. The value returned by
  <code>timer_getoverrun()</code> will apply to the most recent expiration signal delivery
  or acceptance for the timer.  If no expiration signal has been delivered
  for the timer, or if the <i>Realtime Signals Extension</i> is not supported, the
  return value of <code>timer_getoverrun()</code> is unspecified.
</p>
<p>
  <b>NOTE:</b>  This interface is not currently implemented in NuttX.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
 <li><code>timerid</code>. Specifies pre-thread timer, previously created by the call to
 <code>timer_create()</code>, whose overrun count will be returned.</li>
</ul>
<p>
  <b>Returned Values:</b>
  If the <code>timer_getoverrun()</code> function succeeds, it will return the timer
  expiration overrun count as explained above. <code>timer_getoverrun()</code> will fail if:
</p>
<ul>
  <li><code>EINVAL</code>.
  The <code>timerid</code> argument does not correspond to an ID returned by
  <code>timer_create()</code> but not yet deleted by <code>timer_delete()</code>.</li>
</ul>
<p>
  <b>POSIX Compatibility:</b>
  Comparable to the POSIX interface of the same name. Differences from the full POSIX implementation include:
</p>
<ul>
  <li>This interface is not currently implemented by NuttX.</li>
</ul>

<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<hr>

<H2>2.8 <A NAME="Signals">Signal Interfaces</a></H2>

<p>
  NuttX provides signal interfaces for tasks. Signals are used to
  alter the flow control of tasks by communicating asynchronous events
  within or between task contexts.
  Any task or interrupt handler can post (or send) a signal to a particular task.
  The task being signaled will execute task-specified signal handler
  function the next time that the task has priority.
  The signal handler is a user-supplied function that is bound to
  a specific signal and performs whatever actions are necessary
  whenever the signal is received.
</p>
<p>
  There are no predefined actions for any signal.
  The default action for all signals (i.e., when no signal handler has
  been supplied by the user) is to ignore the signal.
  In this sense, all NuttX are <i>real time</i> signals.
</p>
<p>
  Tasks may also suspend themselves and wait until a signal is received.
</p>
<p>
  The following signal handling interfaces are provided by NuttX:
</p>
<ul>
  <li><a href="#sigemptyset">2.8.1 sigemptyset</a></li>
  <li><a href="#sigfillset">2.8.2 sigfillset</a></li>
  <li><a href="#sigaddset">2.8.3 sigaddset</a></li>
  <li><a href="#sigdelset">2.8.4 sigdelset</a></li>
  <li><a href="#sigismember">2.8.5 sigismember</a></li>
  <li><a href="#sigaction">2.8.6 sigaction</a></li>
  <li><a href="#sigprocmask">2.8.7 sigprocmask</a></li>
  <li><a href="#sigpending">2.8.8 sigpending</a></li>
  <li><a href="#sigsuspend">2.8.9 sigsuspend</a></li>
  <li><a href="#sigwaitinfo">2.8.10 sigwaitinfo</a></li>
  <li><a href="#sigtimedwait">2.8.11 sigtimedwait</a></li>
  <li><a href="#sigqueue">2.8.12 sigqueue</a></li>
  <li><a href="#kill">2.8.13 kill</a></li>
</ul>

<H3><a name="sigemptyset">2.8.1 sigemptyset</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int sigemptyset(sigset_t *set);
</pre>

<p>
<b>Description:</b> This function initializes the signal set specified
by set such that all signals are excluded.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>set</I>. Signal set to initialize.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK), or -1 (ERROR) if the signal set cannot be initialized.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="sigfillset">2.8.2 sigfillset</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int sigfillset(sigset_t *set);
</pre>

<p>
<b>Description:</b> This function initializes the signal set specified
by set such that all signals are included.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>set</I>. Signal set to initialize
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK), or -1 (ERROR) if the signal set cannot be initialized.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="sigaddset">2.8.3 sigaddset</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int sigaddset(sigset_t *set, int signo);
</pre>

<p>
<b>Description:</b> This function adds the signal specified by
signo to the signal set specified by set.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>set</I>. Signal set to add signal to
<li><I>signo</I>. Signal to add
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK), or -1 (ERROR) if the signal number is invalid.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="sigdelset">2.8.4 sigdelset</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int sigdelset(sigset_t *set, int signo);
</pre>

<p>
<b>Description:</b> This function deletes the signal specified
by signo from the signal set specified by set.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>set</I>. Signal set to delete the signal from
<li><I>signo</I>. Signal to delete
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK), or -1 (ERROR) if the signal number is invalid.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="sigismember">2.8.5 sigismember</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int  sigismember(const sigset_t *set, int signo);
</pre>

<p>
<b>Description:</b> This function tests whether the signal specified
by signo is a member of the set specified by set.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>set</I>. Signal set to test
<li><I>signo</I>. Signal to test for
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>1 (TRUE), if the specified signal is a member of the set,
<li>0 (OK or FALSE), if it is not, or
<li>-1 (ERROR) if the signal number is invalid.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="sigaction">2.8.6 sigaction</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int sigaction( int signo, const struct sigaction *act,
                   struct sigaction *oact );
</pre>

<p>
<b>Description:</b> This function allows the calling task to
examine and/or specify the action to be associated with a specific
signal.
<p>
The structure sigaction, used to describe an action to be taken, is defined
to include the following members:
<ul>
<li><I>sa_u.sa_handler</I>.  A pointer to a signal-catching function.
<li><I>sa_u.sa_sigaction</I>.  An alternative form for the signal catching
function.
<li><I>sa_mask</I>.  Additional set of signals to be blocked during
execution of the signal-catching function.
<li><I>sa_flags</I>:  Special flags to affect behavior of a signal.
</ul>
<p>
If the argument act is not NULL, it points to a structure specifying the
action to be associated with the specified signal.  If the argument oact
is not NULL, the action previously associated with the signal is stored
in the location pointed to by the argument oact.  If the argument act is
NULL, signal handling is unchanged by this function call; thus, the call
can be used to enquire about the current handling of a given signal.
<p>
When a signal is caught by a signal-catching function installed by the
sigaction() function, a new signal mask is calculated and installed for
the duration of the signal-catching function.  This mask is formed by taking
the union of the current signal mask and the value of the sa_mask for the
signal being delivered, and then including the signal being delivered.  If
and when the signal handler returns, the original signal mask is restored.
<p>
Signal catching functions execute in the same address environment as the
task that called sigaction() to install the signal-catching function.
<p>
Once an action is installed for a specific signal, it remains installed
until another action is explicitly requested by another call to
sigaction().
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>sig</I>. Signal of interest
<li><I>act</I>. Location of new handler
<li><I>oact</I>. Location to store old handler
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK), or -1 (ERROR) if the signal number is invalid.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.
Differences from the POSIX implementation include:
<ul>
<li>Special values of sa_handler in the struct sigaction act input
not handled (SIG_DFL, SIG_IGN).
<li>All sa_flags in struct sigaction of act input are ignored
(all treated like SA_SIGINFO).
</ul>

<H3><a name="sigprocmask">2.8.7 sigprocmask</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int sigprocmask(int how, const sigset_t *set, sigset_t *oset);
</pre>

<p>
<b>Description:</b> This function allows the calling task to
examine and/or change its signal mask. If the set is not NULL,
then it points to a set of signals to be used to change the currently
blocked set. The value of how indicates the manner in which the
set is changed.
<p>
If there are any pending unblocked signals after the call to sigprocmask(),
those signals will be delivered before sigprocmask() returns.
<p>
If sigprocmask() fails, the signal mask of the task is not changed.
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>how</I>. How the signal mast will be changed:
<ul>
<li><I>osSIG_BLOCK</I>. The resulting set is the union of the
current set and the signal set pointed to by the <I>set</I> input parameter.
<li><I>osSIG_UNBLOCK</I>. The resulting set is the intersection
of the current set and the complement of the signal set pointed
to by the <I>set</I> input parameter.
<li><I>osSIG_SETMASK</I>. The resulting set is the signal set
pointed to by the <I>set</I> input parameter.
</ul>

<li><I>set</I>. Location of the new signal mask
<li><I>oset</I>. Location to store the old signal mask
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK), or -1 (ERROR) if how is invalid.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="sigpending">2.8.8 sigpending</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int sigpending( sigset_t *set );
</pre>

<p>
<b>Description:</b> This function stores the returns the set of
signals that are blocked for delivery and that are pending for
the calling task in the space pointed to by set.
<p>
If the task receiving a signal has the signal blocked via its
sigprocmask, the signal will pend until it is unmasked.  Only one pending
signal (for a given signo) is retained by the system.  This is consistent
with POSIX which states:  &quot;If a subsequent occurrence of a pending
signal is generated, it is implementation defined as to whether the signal
is delivered more than once.&quot;
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>set</I>. The location to return the pending signal set.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>0 (OK) or -1 (ERROR)
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="sigsuspend">2.8.9 sigsuspend</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int sigsuspend( const sigset_t *set );
</pre>

<p>
<b>Description:</b> The sigsuspend() function replaces the signal mask
with the set of signals pointed to by the argument set and then suspends
the task until delivery of a signal to the task.
<p>
If the effect of the set argument is to unblock a pending signal, then
no wait is performed.
<p>
The original signal mask is restored when sigsuspend() returns.
<p>
Waiting for an empty signal set stops a task without freeing any
resources (a very bad idea).
<p>
<b>Input Parameters:</b>
<ul>
<li><I>set</I>.  The value of the signal <b>mask</b> to use while
suspended.
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>-1 (ERROR) always
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.
Differences from the POSIX specification include:
<ul>
<li>POSIX does not indicate that the original signal mask is restored.
<li>POSIX states that sigsuspend() &quot;suspends the task until
delivery of a signal whose action is either to execute a signal-catching
function or to terminate the task.&quot;  Only delivery of the signal
is required in the present implementation (even if the signal is ignored).
</ul>

<H3><a name="sigwaitinfo">2.8.10 sigwaitinfo</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int sigwaitinfo(const sigset_t *set, struct siginfo *info);
</pre>

<p>
<b>Description:</b> This function is equivalent to sigtimedwait()
with a NULL timeout parameter. (see below).
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>set</I>.  The set of pending signals to wait for.
<li><I>info</I>. The returned signal values
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>Signal number that cause the wait to be terminated, otherwise
-1 (ERROR) is returned.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="sigtimedwait">2.8.11 sigtimedwait</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int sigtimedwait( const sigset_t *set, struct siginfo *info,
                      const struct timespec *timeout );
</pre>

<p>
<b>Description:</b> This function selects the pending signal set
specified by the argument set. If multiple signals are pending in set,
it will remove and return the lowest numbered one. If no signals in set
are pending at the time of the call, the calling task will be suspended
until one of the signals in set becomes pending OR until the task
interrupted by an unblocked signal OR until the time interval specified by
timeout (if any), has expired. If timeout is NULL, then the timeout interval
is forever.
<p>
If the info argument is non-NULL, the selected signal number is
stored in the si_signo member and the cause of the signal is store
in the si_code member. The content of si_value is only meaningful
if the signal was generated by sigqueue(). The following values
for si_code are defined in signal.h:
<ul>
  <li><I>SI_USER</I>. Signal sent from kill, raise, or abort
  <li><I>SI_QUEUE</I>. Signal sent from sigqueue
  <li><I>SI_TIMER</I>. Signal is result of timer expiration
  <li><I>SI_ASYNCIO</I>. Signal is the result of asynch IO completion 
  <li><I>SI_MESGQ</I>. Signal generated by arrival of a message on an empty message queue.
</ul>

<p>
<b>Input Parameters:</b> 
<ul>
<li><I>set</I>.  The set of pending signals to wait for.
<li><I>info</I>. The returned signal values
<li><I>timeout</I>. The amount of time to wait
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>Signal number that cause the wait to be terminated, otherwise
-1 (ERROR) is returned.
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.
Differences from the POSIX interface include:
<ul>
<li>Values for si_codes differ
<li>No mechanism to return cause of ERROR. (It can be inferred
from si_code in a non-standard way).
<li>POSIX states that &quot;If no signal is pending at the time of the
call, the calling task shall be suspended until one or more signals
in set become pending or until it is interrupted by an unblocked,
<I>caught</I> signal.&quot;  The present implementation does not require
that the unblocked signal be caught; the task will be resumed even if
the unblocked signal is ignored.
</ul>

<H3><a name="sigqueue">2.8.12 sigqueue</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
    #include &lt;signal.h&gt;
    int sigqueue (int tid, int signo, const union sigval value);
</pre>

<p>
<b>Description:</b> This function sends the signal specified by
signo with the signal parameter value to the task specified
by tid.
<p>
If the receiving task has the signal blocked via its sigprocmask,
the signal will pend until it is unmasked.  Only one pending signal
(for a given signo) is retained by the system.  This is consistent with
POSIX which states:  &quot;If a subsequent occurrence of a pending signal
is generated, it is implementation defined as to whether the signal
is delivered more than once.&quot;
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>tid</I>. ID of the task to receive signal
<li><I>signo</I>. Signal number
<li><I>value</I>. Value to pass to task with signal
</ul>

<p>
<b>Returned Values:</b> 
<ul>
<li>
  On  success (at least one signal was sent), zero (OK) is returned.
  On error, -1 (ERROR) is returned, and errno is set appropriately.
  <ul>
    <li><code>EGAIN</code>. The limit of signals which may be queued has been reached.</li>
    <li><code>EINVAL</code>. signo was invalid.</li>
    <li><code>EPERM</code>.  The task does not have permission to send the signal to the receiving process.</li>
    <li><code>ESRCH</code>. No process has a PID matching pid.</li>
  </ul>
</ul>

<p>
<b>Assumptions/Limitations:</b> 
<p>
<b>  POSIX  Compatibility:</b> Comparable to the POSIX
interface of the same name.
Differences from the POSIX interface include:
<ul>
<li>Default action is to ignore signals.
<li>Signals are processed one at a time in order
<li>POSIX states that, &quot;If signo is zero (the null signal), error
checking will be performed but no signal is actually sent.&quot;
There is no null signal in the present implementation; a zero signal will
be sent.
</ul>

<H3><a name="kill">2.8.13 kill</a></H3>

<p>
<b>Function Prototype:</b> 
<pre>
   #include &lt;sys/types.h&gt;
   #include &ltsignal.h&gt;
   int kill(pid_t pid, int sig);
</pre>

<p>
<b>Description:</b> 
  The kill() system call can be used to send any signal to
  any task.
</p>
<p>
  If the receiving task has the signal blocked via its sigprocmask,
  the signal will pend until it is unmasked.  Only one pending signal
  (for a given signo) is retained by the system.  This is consistent with
  POSIX which states:  &quot;If a subsequent occurrence of a pending signal
  is generated, it is implementation defined as to whether the signal
  is delivered more than once.&quot;
</p>
<p>
<b>Input Parameters:</b> 
<ul>
<li><I>pid</I>. The id of the task to receive the signal.
  The POSIX <code>kill()</code> specification encodes process group
  information as zero and negative pid values.
  Only positive, non-zero values of pid are supported by this
  implementation. ID of the task to receive signal
<li><I>signo</I>. The signal number to send.
  If signo is zero, no signal is sent, but all error checking is performed.
</ul>

<p>
  <b>Returned Values:</b> 
  <ul>
    <li>OK or ERROR
  </ul>
</p>

<p>
  <b>Assumptions/Limitations:</b> 
</p>
<p>
  <b>POSIX  Compatibility:</b>
    Comparable to the POSIX interface of the same name.
    Differences from the POSIX interface include:
</p>
<ul>
  <li>Default action is to ignore signals.</li>
  <li>Signals are processed one at a time in order </li>
  <li>Sending of signals to 'process groups' is not supported in NuttX.</li>
</ul>

<H2>2.9 <A NAME="Pthread">Pthread Interfaces</a></H2>
<p>
  NuttX does not support <i>processes</i> in the way that, say, Linux does.
  NuttX only supports simple threads or tasks running within the same address space.
  For the most part, threads and tasks are interchangeable and differ primarily
  only in such things as the inheritance of file descriptors.
  Basically, threads are initialized and uninitialized differently and share a
  few more resources than tasks.
<p>
  The following pthread interfaces are supported in some form by NuttX:
</p>
<ul>
  <li><a href="#pthreadattrinit">2.9.1 pthread_attr_init</a></li>
  <li><a href="#pthreadattrdestroy">2.9.2 pthread_attr_destroy</a></li>
  <li><a href="#pthreadattrsetschedpolity">2.9.3 pthread_attr_setschedpolicy</a></li>
  <li><a href="#pthreadattrgetschedpolicy">2.9.4 pthread_attr_getschedpolicy</a></li>
  <li><a href="#pthreadattrsetschedparam">2.9.5 pthread_attr_setschedparam</a></li>
  <li><a href="#pthreadattrgetschedparam">2.9.6 pthread_attr_getschedparam</a></li>
  <li><a href="#pthreadattrsetinheritsched">2.9.7 pthread_attr_setinheritsched</a></li>
  <li><a href="#pthreadattrgetinheritsched">2.9.8 pthread_attr_getinheritsched</a></li>
  <li><a href="#pthreadattrsetstacksize">2.9.9 pthread_attr_setstacksize</a></li>
  <li><a href="#pthreadattrgetstacksize">2.9.10 pthread_attr_getstacksize</a></li>
  <li><a href="#pthreadcreate">2.9.11 pthread_create</a></li>
  <li><a href="#pthreaddetach">2.9.12 pthread_detach</a></li>
  <li><a href="#pthreadexit">2.9.13 pthread_exit</a></li>
  <li><a href="#pthreadcancel">2.9.14 pthread_cancel</a></li>
  <li><a href="#pthreadsetcancelstate">2.9.15 pthread_setcancelstate</a></li>
  <li><a href="#pthreadtestcancelstate">2.9.16 pthread_testcancelstate</a></li>
  <li><a href="#pthreadjoin">2.9.17 pthread_join</a></li>
  <li><a href="#pthreadyield">2.9.18 pthread_yield</a></li>
  <li><a href="#pthreadself">2.9.19 pthread_self</a></li>
  <li><a href="#pthreadgetschedparam">2.9.20 pthread_getschedparam</a></li>
  <li><a href="#pthreadsetschedparam">2.9.21 pthread_setschedparam</a></li>
  <li><a href="#pthreadkeycreate">2.9.22 pthread_key_create</a></li>
  <li><a href="#pthreadsetspecific">2.9.23 pthread_setspecific</a></li>
  <li><a href="#pthreadgetspecific">2.9.24 pthread_getspecific</a></li>
  <li><a href="#pthreadkeydelete">2.9.25 pthread_key_delete</a></li>
  <li><a href="#pthreadmutexattrinit">2.9.26 pthread_mutexattr_init</a></li>
  <li><a href="#pthreadmutexattrdestroy">2.9.27 pthread_mutexattr_destroy</a></li>
  <li><a href="#pthreadmutexattrgetpshared">2.9.28 pthread_mutexattr_getpshared</a></li>
  <li><a href="#pthreadmutexattrsetpshared">2.9.29 pthread_mutexattr_setpshared</a></li>
  <li><a href="#pthreadmutexinit">2.9.30 pthread_mutex_init</a></li>
  <li><a href="#pthreadmutexdestrory">2.9.31 pthread_mutex_destroy</a></li>
  <li><a href="#pthreadmutexlock">2.9.32 pthread_mutex_lock</a></li>
  <li><a href="#pthreadmutextrylock">2.9.33 pthread_mutex_trylock</a></li>
  <li><a href="#pthreadmutexunlock">2.9.34 pthread_mutex_unlock</a></li>
  <li><a href="#pthreadconaddrinit">2.9.35 pthread_condattr_init</a></li>
  <li><a href="#pthreadocndattrdestroy">2.9.36 pthread_condattr_destroy</a></li>
  <li><a href="#pthreadcondinit">2.9.37 pthread_cond_init</a></li>
  <li><a href="#pthreadconddestroy">2.9.38 pthread_cond_destroy</a></li>
  <li><a href="#pthreadcondbroadcast">2.9.39 pthread_cond_broadcast</a></li>
  <li><a href="#pthreadcondsignal">2.9.40 pthread_cond_signal</a></li>
  <li><a href="#pthreadcondwait">2.9.41 pthread_cond_wait</a></li>
  <li><a href="#pthreadcondtimedwait">2.9.42 pthread_cond_timedwait</a></li>
  <li><a href="#pthreadbarrierattrinit">2.9.43 pthread_barrierattr_init</a></li>
  <li><a href="#pthreadbarrierattrdestroy">2.9.44 pthread_barrierattr_destroy</a></li>
  <li><a href="#pthreadbarrierattrsetpshared">2.9.45 pthread_barrierattr_setpshared</a></li>
  <li><a href="#pthreadbarrierattrgetpshared">2.9.46 pthread_barrierattr_getpshared</a></li>
  <li><a href="#pthreadbarrierinit">2.9.47 pthread_barrier_init</a></li>
  <li><a href="#pthreadbarrierdestroy">2.9.48 pthread_barrier_destroy</a></li>
  <li><a href="#pthreadbarrierwait">2.9.49 pthread_barrier_wait</a></li>
  <li><a href="#pthreadonce">2.9.50 pthread_once</a></li>
  <li><a href="#pthreadkill">2.9.51 pthread_kill</a></li>
  <li><a href="#pthreadsigmask">2.9.52 pthread_sigmask</a></li>
</ul>
<p>
  No support for the ollowing pthread interfaces is provided by NuttX:
</p>
<ul>
  <li><code>pthread_atfork</code>. register fork handlers.</li>
  <li><code>pthread_attr_getdetachstate</code>. get and set the detachstate attribute.</li>
  <li><code>pthread_attr_getguardsize</code>. get and set the thread guardsize attribute.</li>
  <li><code>pthread_attr_getinheritsched</code>. get and set the inheritsched attribute.</li>
  <li><code>pthread_attr_getscope</code>. get and set the contentionscope attribute.</li>
  <li><code>pthread_attr_getstack</code>. get and set stack attributes.</li>
  <li><code>pthread_attr_getstackaddr</code>. get and set the stackaddr attribute.</li>
  <li><code>pthread_attr_setdetachstate</code>. get and set the detachstate attribute.</li>
  <li><code>pthread_attr_setguardsize</code>. get and set the thread guardsize attribute.</li>
  <li><code>pthread_attr_setscope</code>. get and set the contentionscope attribute.</li>
  <li><code>pthread_attr_setstack</code>. get and set stack attributes.</li>
  <li><code>pthread_attr_setstackaddr</code>. get and set the stackaddr attribute.</li>
  <li><code>pthread_barrier_destroy</code>. destroy and initialize a barrier object.</li>
  <li><code>pthread_barrier_init</code>. destroy and initialize a barrier object.</li>
  <li><code>pthread_barrier_wait</code>. synchronize at a barrier.</li>
  <li><code>pthread_cleanup_pop</code>. establish cancellation handlers.</li>
  <li><code>pthread_cleanup_push</code>. establish cancellation handlers.</li>
  <li><code>pthread_condattr_getclock</code>. get and set the clock selection condition variable attribute.</li>
  <li><code>pthread_condattr_getpshared</code>. get and set the process-shared condition variable attributes.</li>
  <li><code>pthread_condattr_setclock</code>. get and set the clock selection condition variable attribute.</li>
  <li><code>pthread_condattr_setpshared</code>. get and set the process-shared condition variable attributes.</li>
  <li><code>pthread_getconcurrency</code>. get and set the level of concurrency.</li>
  <li><code>pthread_getcpuclockid</code>. access a thread CPU-time clock.</li>
  <li><code>pthread_mutex_getprioceiling</code>. get and set the priority ceiling of a mutex.</li>
  <li><code>pthread_mutex_setprioceiling</code>. get and set the priority ceiling of a mutex.</li>
  <li><code>pthread_mutex_timedlock</code>. lock a mutex.</li>
  <li><code>pthread_mutexattr_getprioceiling</code>. get and set the prioceiling attribute of the mutex attributes object.</li>
  <li><code>pthread_mutexattr_getprotocol</code>. get and set the protocol attribute of the mutex attributes object.</li>
  <li><code>pthread_mutexattr_gettype</code>. get and set the mutex type attribute.</li>
  <li><code>pthread_mutexattr_setprioceiling</code>. get and set the prioceiling attribute of the mutex attributes object.</li>
  <li><code>pthread_mutexattr_setprotocol</code>. get and set the protocol attribute of the mutex attributes object.</li>
  <li><code>pthread_mutexattr_settype</code>. get and set the mutex type attribute.</li>
  <li><code>pthread_rwlock_destroy</code>. destroy and initialize a read-write lock object.</li>
  <li><code>pthread_rwlock_init</code>. destroy and initialize a read-write lock object.</li>
  <li><code>pthread_rwlock_rdlock</code>. lock a read-write lock object for reading.</li>
  <li><code>pthread_rwlock_timedrdlock</code>. lock a read-write lock for reading.</li>
  <li><code>pthread_rwlock_timedwrlock</code>. lock a read-write lock for writing.</li>
  <li><code>pthread_rwlock_tryrdlock</code>. lock a read-write lock object for reading.</li>
  <li><code>pthread_rwlock_trywrlock</code>. lock a read-write lock object for writing.</li>
  <li><code>pthread_rwlock_unlock</code>. unlock a read-write lock object.</li>
  <li><code>pthread_rwlock_wrlock</code>. lock a read-write lock object for writing.</li>
  <li><code>pthread_rwlockattr_destroy</code>. destroy and initialize the read-write lock attributes object.</li>
  <li><code>pthread_rwlockattr_getpshared</code>. get and set the process-shared attribute of the read-write lock attributes object.</li>
  <li><code>pthread_rwlockattr_init</code>. destroy and initialize the read-write lock attributes object.</li>
  <li><code>pthread_rwlockattr_setpshared</code>. get and set the process-shared attribute of the read-write lock attributes object.</li>
  <li><code>pthread_setcanceltype</code>. set cancelability state.</li>
  <li><code>pthread_setconcurrency</code>. get and set the level of concurrency.</li>
  <li><code>pthread_spin_destroy</code>. destroy or initialize a spin lock object.</li>
  <li><code>pthread_spin_init</code>. destroy or initialize a spin lock object.</li>
  <li><code>pthread_spin_lock</code>. lock a spin lock object.</li>
  <li><code>pthread_spin_trylock</code>. lock a spin lock object.</li>
  <li><code>pthread_spin_unlock</code>. unlock a spin lock object.</li>
  <li><code>pthread_testcancel</code>. set cancelability state.</li>
</ul>

<H3><a name="pthreadattrinit">2.9.1 pthread_attr_init</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_attr_init(pthread_attr_t *attr);
</pre>
<p>
<b>Description:</b>
Initializes a thread attributes object (attr) with default values
for all of the individual attributes used by the implementation.
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_attr_init()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.
<p>
<H3><a name="pthreadattrdestroy">2.9.2 pthread_attr_destroy</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_attr_destroy(pthread_attr_t *attr);
</pre>
<p>
<b>Description:</b>
An attributes object can be deleted when it is no longer needed.
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_attr_destroy()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.
<p>
<H3><a name="pthreadattrsetschedpolity">2.9.3 pthread_attr_setschedpolicy</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_attr_setschedpolicy(pthread_attr_t *attr, int policy);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_attr_setschedpolicy()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadattrgetschedpolicy">2.9.4 pthread_attr_getschedpolicy</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_attr_getschedpolicy(pthread_attr_t *attr, int *policy);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_attr_getschedpolicy()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadattrsetschedparam">2.9.5 pthread_attr_getschedpolicy</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
   #include &lt;pthread.h&gt;
    int pthread_attr_setschedparam(pthread_attr_t *attr,
				      const struct sched_param *param);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_attr_getschedpolicy()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadattrgetschedparam">2.9.6 pthread_attr_getschedparam</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
   #include &lt;pthread.h&gt;
     int pthread_attr_getschedparam(pthread_attr_t *attr,
				      struct sched_param *param);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_attr_getschedparam()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadattrsetinheritsched">2.9.7 pthread_attr_setinheritsched</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
   #include &lt;pthread.h&gt;
    int pthread_attr_setinheritsched(pthread_attr_t *attr,
					int inheritsched);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_attr_setinheritsched()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.
<p>
<H3><a name="pthreadattrgetinheritsched">2.9.8 pthread_attr_getinheritsched</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
   #include &lt;pthread.h&gt;
     int pthread_attr_getinheritsched(const pthread_attr_t *attr,
					int *inheritsched);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_attr_getinheritsched()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadattrsetstacksize">2.9.9 pthread_attr_setstacksize</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
   #include &lt;pthread.h&gt;
    int pthread_attr_setstacksize(pthread_attr_t *attr, long stacksize);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_attr_setstacksize()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadattrgetstacksize">2.9.10 pthread_attr_getstacksize</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
   int pthread_attr_getstacksize(pthread_attr_t *attr, long *stackaddr);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_attr_getstacksize()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadcreate">2.9.11 pthread_create</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_create(pthread_t *thread, pthread_attr_t *attr,
			  pthread_startroutine_t startRoutine,
			  pthread_addr_t arg);
</pre>
<p>
<b>Description:</b>
To create a thread object and runnable thread, a routine
must be specified as the new thread's start routine.  An
argument may be passed to this routine, as an untyped
address; an untyped address may also be returned as the
routine's value.  An attributes object may be used to
specify details about the kind of thread being created.
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_create()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreaddetach">2.9.12 pthread_detach</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_detach(pthread_t thread);
</pre>
<p>
<b>Description:</b>
A thread object may be "detached" to specify that the
return value and completion status will not be requested.
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_detach()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadexit">2.9.13 pthread_exit</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    void pthread_exit(pthread_addr_t pvValue);
</pre>
<p>
<b>Description:</b>
A thread may terminate it's own execution.
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_exit()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadcancel">2.9.14 pthread_cancel</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_cancel(pthread_t thread);
</pre>
<p>
<b>Description:</b>

<p>The  pthread_cancel() function shall request that thread
be canceled. The target thread's cancelability state determines
when the cancellation takes effect. When the
cancellation is acted on, thread shall be terminated.</p>

<p>When cancelability is disabled, all cancels are held pending
in the target thread until the thread changes the cancelability.
When cancelability is deferred, all cancels are held pending in
the target thread until the thread changes the cancelability or
calls pthread_testcancel().</p>

<p>Cancelability is asynchronous; all cancels are acted upon
immediately (when enable), interrupting the thread with its processing.</p>

<p>
<b>Input Parameters:</b>
<p>
<ul>
<li><I>thread</I>.
Identifies the thread to be canceled.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>ptnread_cancel()</I> function will return zero (<I>OK</I>).
Otherwise, an error number will be returned to indicate the error:
<p>
<ul>
<li><I>ESRCH</I>.
No thread could be found corresponding to that specified by the given thread ID.</li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.  Except:</p>
<ul>
<li>The thread-specific data destructor functions shall be called for thread.
However, these destructors are not currently supported.</li>
<li>Cancellation types are not supported.  The thread will be canceled
at the time that pthread_cancel() is called or, if cancelation is disabled, at
the time when cancelation is re-enabled.</li>
<li><tt>pthread_testcancel()</tt> is not supported.</li>
<li>Thread cancellation at <i>cancellation points</i> is not supported.</li>
</ul>

<H3><a name="pthreadsetcancelstate">2.9.15 pthread_setcancelstate</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_setcancelstate(int state, int *oldstate);
</pre>
<p>
<b>Description:</b>
<p>The <i>pthread_setcancelstate()</i> function atomically
sets both the calling thread's cancelability state to the indicated
state and returns the previous cancelability  state at the location
referenced by oldstate.
Legal values for state are PTHREAD_CANCEL_ENABLE and PTHREAD_CANCEL_DISABLE.<.li>

<p>Any pending thread cancelation may occur at the time that the
cancelation state is set to PTHREAD_CANCEL_ENABLE.</p>

<b>Input Parameters:</b>
<p>
<ul>
<li><I>state</I> 
New cancelation state.  One of PTHREAD_CANCEL_ENABLE or PTHREAD_CANCEL_DISABLE.<.li>
<li><I>oldstate</I>.
Location to return the previous cancelation state.
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_setcancelstate()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be returned to indicate the error:
<p>
<ul>
<li><I>ESRCH</I>.
No thread could be found corresponding to that specified by the given thread ID.</li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadtestcancelstate">2.9.16 pthread_testcancelstate</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_setcancelstate(void);
</pre>
<p>
<b>Description:</b>
<p><b>NOT SUPPORTED</b>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_setcancelstate()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadjoin">2.9.17 pthread_join</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_join(pthread_t thread, pthread_addr_t *ppvValue);
</pre>
<p>
<b>Description:</b>
A thread can await termination of another thread and retrieve
the return value of the thread.
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_join()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadyield">2.9.18 pthread_yield</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    void pthread_yield(void);
</pre>
<p>
<b>Description:</b>
A thread may tell the scheduler that its processor can be
made available.
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_yield()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadself">2.9.19 pthread_self</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    pthread_t pthread_self(void);
</pre>
<p>
<b>Description:</b>
A thread may obtain a copy of its own thread handle.
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_self()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadgetschedparam">2.9.20 pthread_getschedparam</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_getschedparam(pthread_t thread, int *policy,
                              struct sched_param *param);
</pre>
<p>
  <b>Description:</b>
  The <code>pthread_getschedparam()</code> functions will get the 
  scheduling policy and parameters of threads.
  For <code>SCHED_FIFO</code> and <code>SCHED_RR</code>, the only
  required member of the <code>sched_param</code> structure is the
  priority <code>sched_priority</code>.
</p>
<p>
  The <code>pthread_getschedparam()</code> function will retrieve the
  scheduling policy and scheduling parameters for the thread whose thread
  ID is given by <code>thread</code> and will store those values in
  <code>policy</code> and <code>param</code>, respectively.
  The priority value returned from <code>pthread_getschedparam()</code>
  will be the value specified by the most recent <code>pthread_setschedparam()</code>,
  <code>pthread_setschedprio()</code>, or <code>pthread_create()</code> call
  affecting the target thread.
  It will not reflect any temporary adjustments to its priority (such as might
  result of any priority inheritance, for example).
</p>
<p>
  The policy parameter may have the value <code>SCHED_FIFO</code> or <code>SCHED_RR</code>
  (<code>SCHED_OTHER</code> and <code>SCHED_SPORADIC</code>, in particular, are not supported).
  The <code>SCHED_FIFO</code> and <code>SCHED_RR<code> policies will have a single
  scheduling parameter, <code>sched_priority</code>.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li>
    <code>thread</code>.
    The ID of thread whose scheduling parameters will be queried.
  </li>
  <li>
    <code>policy</code>.
    The location to store the thread's scheduling policy.
  </li>
  <li>
    <code>param</code>.
    The location to store the thread's priority.
  </li>
</ul>
<p>
  <b>Returned Values:</b>
  0 (<code>OK</code>) if successful.
  Otherwise, the error code <code>ESRCH</code> if the value specified by
  <code>thread</code> does not refer to an existing thread.
</p>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b>
  Comparable to the POSIX interface of the same name.
</p>

<H3><a name="pthreadsetschedparam">2.9.21 pthread_setschedparam</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_setschedparam(pthread_t thread, int policy,
                              const struct sched_param *param);
</pre>
<p>
  <b>Description:</b>
  The <code>pthread_setschedparam()</code> functions will set the scheduling policy
  and parameters of threads.
  For <code>SCHED_FIFO</code> and <code>SCHED_RR</code>, the only required member
  of the <code>sched_param</code> structure is the priority <code>sched_priority</code>.
</p>
</p>
  The <code>pthread_setschedparam()</code> function will set the scheduling policy
  and associated scheduling parameters for the thread whose thread ID is given by
  <code>thread</code> to the policy and associated parameters provided in
  <code>policy</code> and <code>param</code>, respectively.
</p>
<p>
  The policy parameter may have the value <code>SCHED_FIFO</code> or <code>SCHED_RR</code>.
  (<code>SCHED_OTHER</code> and <code>SCHED_SPORADIC</code>, in particular, are not supported).
  The <code>SCHED_FIFO</code> and <code>SCHED_RR</code> policies will have a single
  scheduling parameter, <code>sched_priority</code>.
</p>
<p>
  If the <code>pthread_setschedparam()</code> function fails, the scheduling
  parameters will not be changed for the target thread.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li>
    <code>thread</code>.
    The ID of thread whose scheduling parameters will be modified.
  </li>
  <li>
    <code>policy</code>.
    The new scheduling policy of the thread.
    Either <code>SCHED_FIFO</code> or <code>SCHED_RR<code>.
    <code>SCHED_OTHER<code> and <code>SCHED_SPORADIC<code> are not supported.
  </li>
  <li>
    <code>param</code>.
    The location to store the thread's priority.
  </li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  If successful, the <I>pthread_setschedparam()</I> function will return
  zero (<I>OK</I>).  Otherwise, an error number will be
  returned to indicate the error:
</p>
<ul>
  <li>
    <code>EINVAL</code>.
    The value specified by <code>policy</code> or one of the scheduling parameters
    associated with the scheduling policy <code>policy</code> is invalid.
  </li>
  <li>
    <code>ENOTSUP</code>.
    An attempt was made to set the policy or scheduling parameters to an unsupported
    value (<code>SCHED_OTHER</code> and <code>SCHED_SPORADIC</code> in particular are
    not supported)
  </li>
  <li>
    <code>EPERM</code>.
    The caller does not have the appropriate permission to set either the scheduling
    parameters or the scheduling policy of the specified thread.
    Or, the implementation does not allow the application to modify one of the
    parameters to the value specified.

  </li>
  <li>
    <code>ESRCH</code>.
    The value specified by thread does not refer to a existing thread.
  </li>
</ul>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b>
  Comparable to the POSIX interface of the same name.
</p>

<H3><a name="pthreadkeycreate">2.9.22 pthread_key_create</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_key_create( pthread_key_t *key, void (*destructor)(void*) )
</pre>
<p>
<b>Description:</b>
<p>
This function creates a thread-specific data key visible
to all threads in the system.  Although the same key value
may be used by different threads, the values bound to
the key by <I>pthread_setspecific()</I> are maintained on a
per-thread basis and persist for the life of the calling
thread.
<p>
Upon key creation, the value <I>NULL</I> will be associated with
the the new key in all active threads.  Upon thread
creation, the value <I>NULL</I> will be associated with all
defined keys in the new thread.
<p>
<b>Input Parameters:</b>
<p>
<ul>
<li><I>key</I> is a pointer to the key to create.
<li><I>destructor</I> is an optional destructor() function that may
be associated with each key that is invoked when a
thread exits.  However, this argument is ignored in
the current implementation.
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_key_create()</I> function will
store the newly created key value at *<I>key</I> and return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
<li><I>EAGAIN</I>.  The system lacked sufficient resources
to create another thread-specific data key, or the
system-imposed limit on the total number of keys
per task {<I>PTHREAD_KEYS_MAX</I>} has been exceeded
<li><I>ENONMEM</I>  Insufficient memory exists to create the key.
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.
<ul>
<li>The present implementation ignores the destructor argument.
</ul>

<H3><a name="pthreadsetspecific">2.9.23 pthread_setspecific</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_setspecific( pthread_key_t key, void *value )
</pre>
<p>
<b>Description:</b>
<p>
The <I>pthread_setspecific()</I> function associates a thread-
specific value with a key obtained via a previous call
to <I>pthread_key_create()</I>.  Different threads may bind
different values to the same key.  These values are
typically pointers to blocks of dynamically allocated
memory that have been reserved for use by the calling
thread.
<p>
The effect of calling <I>pthread_setspecific()</I> with a key value
not obtained from <I>pthread_key_create()</I> or after a key has been
deleted with <I>pthread_key_delete()</I> is undefined.
<p>
<b>Input Parameters:</b>
<p>
<ul>
<li><I>key</I>.  The data key to set the binding for.
<li><I>value</I>. The value to bind to the key.
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, <I>pthread_setspecific()</I> will return zero (<I>OK</I>).
Otherwise, an error number will be returned:
<p>
<ul>
<li><I>ENOMEM</I>.  Insufficient memory exists to associate the value
with the key.
<li><I>EINVAL</I>.  The key value is invalid.
</ul>
<p>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.
<ul>
<li>pthread_setspecific() may be called from a thread-specific data
destructor function.
</ul>

<H3><a name="pthreadgetspecific">2.9.24 pthread_getspecific</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    void *pthread_getspecific( pthread_key_t key )
</pre>
<p>
<b>Description:</b>
<p>
The <I>pthread_getspecific()</I> function returns the value
currently bound to the specified key on behalf of the
calling thread.
<p>
The effect of calling <I>pthread_getspecific()</I> with a key value
not obtained from <I>pthread_key_create()</I> or after a key has been
deleted with <I>pthread_key_delete()</I> is undefined.
<p>
<b>Input Parameters:</b>
<p>
<ul>
<li><I>key</I>.  The data key to get the binding for.
</ul>
<p>
<b>Returned Values:</b>
<p>
The function <I>pthread_getspecific()</I> returns the thread-
specific data associated with the given key.  If no
thread specific data is associated with the key, then
the value <I>NULL</I> is returned.
<p>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.
<ul>
<li>pthread_getspecific() may be called from a thread-specific data
destructor function.
</ul>

<H3><a name="pthreadkeydelete">2.9.25 pthread_key_delete</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_key_delete( pthread_key_t key )
</pre>
<p>
<b>Description:</b>
<p>
This POSIX function should delete a thread-specific data
key previously returned by <I>pthread_key_create()</I>.  However,
this function does nothing in the present implementation.
<p>
<b>Input Parameters:</b>
<p>
<ul>
<li><I>key</I>.  The key to delete
</ul>
<p>
<b>Returned Values:</b>
<p>
<ul>
<li>Always returns <I>EINVAL</I>.
</ul>
<p>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadmutexattrinit">2.9.26 pthread_mutexattr_init</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_mutexattr_init(pthread_mutexattr_t *attr);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_mutexattr_init()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadmutexattrdestroy">2.9.27 pthread_mutexattr_destroy</a></H3>
<p>
<b>Function Protoype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_mutexattr_destroy(pthread_mutexattr_t *attr);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_mutexattr_destroy()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadmutexattrgetpshared">2.9.28 pthread_mutexattr_getpshared</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_mutexattr_getpshared(pthread_mutexattr_t *attr,
					int *pshared);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_mutexattr_getpshared()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadmutexattrsetpshared">2.9.29 pthread_mutexattr_setpshared</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
   int pthread_mutexattr_setpshared(pthread_mutexattr_t *attr,
					int pshared);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_mutexattr_setpshared()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadmutexinit">2.9.30 pthread_mutex_init</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_mutex_init(pthread_mutex_t *mutex,
			      pthread_mutexattr_t *attr);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_mutex_init()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadmutexdestrory">2.9.31 pthread_mutex_destroy</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_mutex_destroy(pthread_mutex_t *mutex);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_mutex_destroy()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadmutexlock">2.9.32 pthread_mutex_lock</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_mutex_lock(pthread_mutex_t *mutex);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_mutex_lock()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadmutextrylock">2.9.33 pthread_mutex_trylock</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_mutex_trylock(pthread_mutex_t *mutex);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_mutex_trylock()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadmutexunlock">2.9.34 pthread_mutex_unlock</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_mutex_unlock(pthread_mutex_t *mutex);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>param<code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_mutex_unlock()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadconaddrinit">2.9.35 pthread_condattr_init</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_condattr_init(pthread_condattr_t *attr);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_condattr_init()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadocndattrdestroy">2.9.36 pthread_condattr_destroy</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_condattr_destroy(pthread_condattr_t *attr);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_condattr_destroy()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadcondinit">2.9.37 pthread_cond_init</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_cond_init(pthread_cond_t *cond, pthread_condattr_t *attr);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_cond_init()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadconddestroy">2.9.38 pthread_cond_destroy</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_cond_destroy(pthread_cond_t *cond);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_cond_destroy()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadcondbroadcast">2.9.39 pthread_cond_broadcast</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_cond_broadcast(pthread_cond_t *cond);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_cond_broadcast()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadcondsignal">2.9.40 pthread_cond_signal</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_cond_signal(pthread_cond_t *dond);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
<b>Returned Values:</b>
<p>
If successful, the <I>pthread_cond_signal()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadcondwait">2.9.41 pthread_cond_wait</a></H3>
<p>
<b>Function Prototype:</b>
<p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_cond_wait(pthread_cond_t *cond, pthread_mutex_t *mutex);
</pre>
<p>
<b>Description:</b>
<p>
<b>Input Parameters:</b>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
  <b>Returned Values:</b>
<p>
If successful, the <I>pthread_cond_wait()</I> function will return
zero (<I>OK</I>).  Otherwise, an error number will be
returned to indicate the error:
<p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<b>Assumptions/Limitations:</b>
<p>
<b>POSIX Compatibility:</b> Comparable to the POSIX
interface of the same name.

<H3><a name="pthreadcondtimedwait">2.9.42 pthread_cond_timedwait</a></H3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_cond_timedwait(pthread_cond_t *cond, pthread_mutex_t *mutex,
				  const struct timespec *abstime);
</pre>
<p>
  <b>Description:</b>
</p>
<p>
  <b>Input Parameters:</b>
</p>
<p>
<ul>
  <li><code>To be provided</code>.</li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  If successful, the <code>pthread_cond_timedwait()</code> function will return
  zero (<code>OK</code>).  Otherwise, an error number will be
  returned to indicate the error:
</p>
<ul>
  <li><code>To be provided</code>. </li>
</ul>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b> Comparable to the POSIX interface of the same name.
</p>

<h3><a name="pthreadbarrierattrinit">2.9.43 pthread_barrierattr_init</a></h3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_barrierattr_init(FAR pthread_barrierattr_t *attr);
</pre>
<p>
  <b>Description:</b>
  The <code>pthread_barrierattr_init()</code> function will initialize a barrier
  attribute object <code>attr</code> with the default value for all of the attributes
  defined by the implementation.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li>
    <code>attr</code>. Barrier attributes to be initialized.
</li>
</ul>
<p>
  <b>Returned Values:</b>
  0 (<code>OK</code>) on success or <code>EINVAL</code> if <code>attr</code> is invalid.
</p>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b> Comparable to the POSIX interface of the same name.
</p>

<h3><a name="pthreadbarrierattrdestroy">2.9.44 pthread_barrierattr_destroy</a></h3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_barrierattr_destroy(FAR pthread_barrierattr_t *attr);
</pre>
<p>
  <b>Description:</b>
  The <code>pthread_barrierattr_destroy()</code> function will destroy a barrier attributes object.
  A destroyed attributes object can be reinitialized using <code>pthread_barrierattr_init()</code>;
  the results of otherwise referencing the object after it has been destroyed are undefined.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li>
    <code>attr</code>. Barrier attributes to be destroyed.
</li>
</ul>
<p>
  <b>Returned Values:</b> 0 (OK) on success or EINVAL if attr is invalid.
</p>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b> Comparable to the POSIX interface of the same name.
</p>

<h3><a name="pthreadbarrierattrsetpshared">2.9.45 pthread_barrierattr_setpshared</a></h3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_barrierattr_setpshared(FAR pthread_barrierattr_t *attr, int pshared);
</pre>
<p>
  <b>Description:</b>
  The process-shared attribute is set to <code>PTHREAD_PROCESS_SHARED</code> to permit
  a barrier to be operated upon by any thread that has access to the memory where the
  barrier is allocated.
  If the process-shared attribute is <code>PTHREAD_PROCESS_PRIVATE</code>, the barrier can
  only be operated upon by threads created within the same process as the thread that
  initialized the barrier.
  If threads of different processes attempt to operate on such a barrier, the behavior is undefined.
  The default value of the attribute is <code>PTHREAD_PROCESS_PRIVATE</code>.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li><code>attr</code>. Barrier attributes to be modified.</li>
  <li><code>pshared</code>. The new value of the pshared attribute.</li>
</ul>
<p>
  <b>Returned Values:</b>  0 (<code>OK</code>) on success or <code>EINVAL</code> if either
  <code>attr</code> is invalid or <code>pshared</code> is not one of
  <code>PTHREAD_PROCESS_SHARED</code> or <code>PTHREAD_PROCESS_PRIVATE</code>.
</p>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b> Comparable to the POSIX interface of the same name.
</p>

<h3><a name="pthreadbarrierattrgetpshared">2.9.46 pthread_barrierattr_getpshared</a></h3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_barrierattr_getpshared(FAR const pthread_barrierattr_t *attr, FAR int *pshared);
</pre>
<p>
  <b>Description:</b>
  The <code>pthread_barrierattr_getpshared()</code> function will obtain the value of the
  process-shared attribute from the attributes object referenced by <code>attr</code>.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<p>
<ul>
  <li><code>attr</code>. Barrier attributes to be queried.</li>
  <li><code>pshared</code>. The location to stored the current value of the pshared attribute.</li>
</ul>
<p>
  <b>Returned Values:</b> 0 (<code>OK</code>) on success or <code>EINVAL</code> if
  either <code>attr</code> or <code>pshared</code> is invalid.
</p>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b> Comparable to the POSIX interface of the same name.
</p>

<h3><a name="pthreadbarrierinit">2.9.47 pthread_barrier_init</a></h3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_barrier_init(FAR pthread_barrier_t *barrier,
                             FAR const pthread_barrierattr_t *attr, unsigned int count);
</pre>
<p>
  <b>Description:</b>
  The <code>pthread_barrier_init()</code> function allocates any resources required to
  use the barrier referenced by <code>barrier</code> and initialized the barrier with
  the attributes referenced by <code>attr</code>. 
  If <code>attr</code> is NULL, the default barrier attributes will be used.
  The results are undefined if <code>pthread_barrier_init()</code> is called when any
  thread is blocked on the barrier.
  The results are undefined if a barrier is used without first being initialized.
  The results are undefined if <code>pthread_barrier_init()</code> is called specifying
  an already initialized barrier.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li>
    <code>barrier</code>.
    The barrier to be initialized.
  </li>
  <li>
    <code>attr</code>.
    Barrier attributes to be used in the initialization.
  </li>
  <li>
    <code>count</code>.
    The count to be associated with the barrier.
    The count argument specifies the number of threads that must call
    <code>pthread_barrier_wait()</code> before any of them successfully return from the call.
    The value specified by count must be greater than zero.
  </li>
</ul>
<p>
  <b>Returned Values:</b>0 (OK) on success or on of the following error numbers:
</p>
<ul>
  <li>
    <code>EAGAIN</code>.
    The system lacks the necessary resources to initialize another barrier.
  </li>
  <li>
    <code>EINVAL</code>.
    The barrier reference is invalid, or the values specified by attr are invalid, or
    the value specified by count is equal to zero.
  </li>
  <li>
    <code>ENOMEM</code>.
    Insufficient memory exists to initialize the barrier.
  </li>
  <li>
    <code>EBUSY</code>.
    The implementation has detected an attempt to reinitialize a barrier while it is in use.
  </li>
</ul>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b> Comparable to the POSIX interface of the same name.
</p>

<h3><a name="pthreadbarrierdestroy">2.9.48 pthread_barrier_destroy</a></h3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_barrier_destroy(FAR pthread_barrier_t *barrier);
</pre>
<p>
  <b>Description:</b>
  The <code>pthread_barrier_destroy()</code> function destroys the barrier referenced
  by <code>barrie</code> and releases any resources used by the barrier.
  The effect of subsequent use of the barrier is undefined until the barrier is
  reinitialized by another call to <code>pthread_barrier_init()</code>.
  The results are undefined if <code>pthread_barrier_destroy()</code> is called when
  any thread is blocked on the barrier, or if this function is called with an
  uninitialized barrier.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li><code>barrier</code>. The barrier to be destroyed.</li>
</ul>
<p>
  <b>Returned Values:</b> 0 (<code>OK</code>) on success or on of the following error numbers:
</p>
<ul>
  <li>
    <code>EBUSY</code>.
    The implementation has detected an attempt to destroy a barrier while it is in use.
  </li>
  <li>
    <code>EINVAL</code>.
    The value specified by barrier is invalid.
  </li>
</ul>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b> Comparable to the POSIX interface of the same name.
</p>

<h3><a name="pthreadbarrierwait">2.9.49 pthread_barrier_wait</a></h3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_barrier_wait(FAR pthread_barrier_t *barrier);
</pre>
<p>
  <b>Description:</b>
  The <code>pthread_barrier_wait()</code> function synchronizse participating
  threads at the barrier referenced by <code>barrier</code>.
  The calling thread is blocked until the required number of threads have called
  <code>pthread_barrier_wait()</code> specifying the same <code>barrier</code>.
  When the required number of threads have called <code>pthread_barrier_wait()</code>
  specifying the <code>barrier</code>, the constant <code>PTHREAD_BARRIER_SERIAL_THREAD</code>
  will be returned to one unspecified thread and zero will be returned to each of
  the remaining threads.
  At this point, the barrier will be reset to the state it had as a result of the most
  recent <code>pthread_barrier_init()</code> function that referenced it.
</p>
<p>
  The constant <code>PTHREAD_BARRIER_SERIAL_THREAD</code> is defined in 
 <code>pthread.h</code> and its value must be distinct from any other value
  returned by <code>pthread_barrier_wait()</code>.
</p>
<p>
  The results are undefined if this function is called with an uninitialized barrier.
</p>
<p>
  If a signal is delivered to a thread blocked on a barrier, upon return from the
  signal handler the thread will resume waiting at the barrier if the barrier wait
  has not completed.
  Otherwise, the thread will continue as normal from the completed barrier wait.
  Until the thread in the signal handler returns from it, it is unspecified whether
  other threads may proceed past the barrier once they have all reached it.
</p>
<p>
  A thread that has blocked on a barrier will not prevent any unblocked thread that
  is eligible to use the same processing resources from eventually making forward
  progress in its execution.
  Eligibility for processing resources will be determined by the scheduling policy.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<ul>
  <li><code>barrier</code>. The barrier on which to wait.</li>
</ul>
<p>
  <b>Returned Values:</b> 0 (<code>OK</code>) on success or <code>EINVAL</code> if the barrier is not valid.
</p>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b> Comparable to the POSIX interface of the same name.
</p>


<h3><a name="pthreadonce">2.9.50 pthread_once</a></h3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;pthread.h&gt;
    int pthread_once(FAR pthread_once_t *once_control, CODE void (*init_routine)(void));
</pre>
<p>
  <b>Description:</b>
  The  first  call to <code>pthread_once()</code> by any thread with a given
  <code>once_control</code>, will call the <code>init_routine()</code> with no arguments.
  Subsequent calls to <code>pthread_once()</code> with the same <code>once_control</code> will have no effect.
  On return from <code>pthread_once()</code>, <code>init_routine()</code> will have completed.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<p>
<ul>
  <li>
    <code>once_control</code>.
    Determines if <code>init_routine()</code> should be called.
    <code>once_control</code> should be declared and intialized as follows:
    <ul><pre>pthread_once_t once_control = PTHREAD_ONCE_INIT;
    </pre></ul>
    <code>PTHREAD_ONCE_INIT</code> is defined in <code>pthread.h</code>.
  </li>
  <li>
    <code>init_routine</code>.
    The initialization routine that will be called once.
  </li>
</ul>
<p>
  <b>Returned Values:</b>
  0 (OK) on success or EINVAL if either once_control or init_routine are invalid.
</p>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b> Comparable to the POSIX interface of the same name.
</p>

<h3><a name="pthreadkill">2.9.51 pthread_kill</a></h3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;signal.h&gt;
    #include &lt;pthread.h&gt;
    int pthread_kill(pthread_t thread, int signo)
</pre>
<p>
  <b>Description:</b>
  The <code>pthread_kill()</code> system call can be used to send any
  signal to a thread.  See <code>kill()</code> for further information
  as this is just a simple wrapper around the <code>kill()</code>
  function.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<p>
<ul>
  <li>
    <code>thread</code>.
    The id of the thread to receive the signal. Only positive, non-zero values of <code>tthread</code>t are supported.
  </li>
  <li>
    <code>signo</code>.
    The signal number to send.  If <code>signo</code> is zero, no signal is sent, but all error checking is performed.
  </li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  On success, the signal was sent and zero is returned.
  On error one of the following error numbers is returned.
</p>
<ul>
  <li>
    <code>EINVAL</code>.
    An invalid signal was specified.
  </li>
  <li>
    <code>EPERM</code>.
    The thread does not have permission to send the signal to the target thread.
  </li>
  <li>
    <code>ESRCH</code>.
    No thread could be found corresponding to that specified by the given thread ID.
  </li>
  <li>
    <code>ENOSYS</code>.
    Do not support sending signals to process groups.
  </li>
</ul>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b> Comparable to the POSIX interface of the same name.
</p>

<h3><a name="pthreadsigmask">2.9.52 pthread_sigmask</a></h3>
<p>
  <b>Function Prototype:</b>
</p>
<pre>
    #include &lt;signal.h&gt;
    #include &lt;pthread.h&gt;
    int pthread_sigmask(int how, FAR const sigset_t *set, FAR sigset_t *oset);
</pre>
<p>
  <b>Description:</b>
  This function is a simple wrapper around <code>sigprocmask()</code>.
  See the <code>sigprocmask()</code> function description for further information.
</p>
<p>
  <b>Input Parameters:</b>
</p>
<p>
<ul>
  <li>
    <code>how</code>. How the signal mast will be changed:
    <ul>
      <li>
        <code>SIG_BLOCK</code>:
        The resulting set is the union of the current set and the signal set pointed to by <code>set</code>.
      </li>
      <li>
        <code>SIG_UNBLOCK</code>:
        The resulting set is the intersection of the current set and the complement of the signal set pointed to by <code>set</code>.
      </li>
      <li>
        <code>SIG_SETMASK</code>:
        The resulting set is the signal set pointed to by <code>set</code>.
      </li>
    </ul>
  </li>
  <li>
    <code>set</code>. Location of the new signal mask.
  </li>
  <li>
    <code>oset</code>. Location to store the old signal mask.
  </li>
</ul>
<p>
  <b>Returned Values:</b>
</p>
<p>
  0 (OK) on succes or EINVAL if <code>how</code> is invalid.
</p>
<p>
  <b>Assumptions/Limitations:</b>
</p>
<p>
  <b>POSIX Compatibility:</b> Comparable to the POSIX interface of the same name.
</p>

<hr>
<h1>3.0 <A NAME="Data_Structures">OS Data Structures</a></h1>
<H2>3.1 Scalar types</H2>
<p>
Many of the types used to communicate with NuttX are simple
scalar types. These types are used to provide architecture independence
of the OS from the application. The scalar types used at the NuttX
interface include:
<ul>
<li>pid_t
<li>size_t
<li>sigset_t
<li>STATUS
<li>time_t
</ul>

<H2>3.2 Hidden Interface Structures</H2>
<p>
Several of the types used to interface with NuttX are
structures that are intended to be hidden from the application.
From the standpoint of the application, these structures (and
structure pointers) should be treated as simple handles to reference
OS resources. These hidden structures include:
<ul>
<li>_TCB
<li>mqd_t
<li>sem_t
<li>WDOG_ID
<li>pthread_key_t
</ul>
<p>
In order to maintain portability, applications should not reference
specific elements within these hidden structures. These hidden
structures will not be described further in this user's manual.
<p>

<H2>3.3. Access to the <I>errno</I> Variable</H2>
<p>
A pointer to the thread-specific <I>errno</I>. value is available through a
function call:
<p>
<b>Function Prototype:</b>
<p>
<pre>    int *get_errno_ptr( void )</pre>
<p>
<b>Description</b>:  <I>osGetErrnorPtr()</I> returns a pointer to
the thread-specific <I>errno</I> value.
<p>
This differs somewhat from the use for errno in a multi-threaded process environment:
Each pthread will have its own private copy of errno and the errno will not be shared
between pthreads.
<p>
<b>Input Parameters</b>:  None
<p>
<b>Returned Values</b>:
<p>
<ul>
<li>A pointer to the thread-specific <I>errno</I> value.
</ul>
<p>

<H2>3.4 User Interface Structures</H2>
<p>
<H3>3.4.1 main_t</H3>
<p>
main_t defines the type of a task entry point. main_t is declared
in sys/types.h as:
<pre>
    typedef int (*main_t)(int argc, char *argv[]);
</pre>

<H3>3.4.2 struct sched_param</H3>

<p>
This structure is used to pass scheduling priorities to and from
NuttX;
<pre>
    struct sched_param
    {
      int sched_priority;
    };
</pre>

<H3>3.4.3 struct timespec</H3>

<p>
This structure is used to pass timing information between the
NuttX and a user application:
<pre>
    struct timespec
    {
      time_t tv_sec;  /* Seconds */
      long   tv_nsec; /* Nanoseconds */
    };
</pre>

<H3>3.4.4 struct mq_attr</H3>

<p>
This structure is used to communicate message queue attributes
between NuttX and a MoBY application:
<pre>
    struct mq_attr {
      size_t       mq_maxmsg;   /* Max number of messages in queue */
      size_t       mq_msgsize;  /* Max message size */
      unsigned     mq_flags;    /* Queue flags */
      size_t       mq_curmsgs;  /* Number of messages currently in queue */
    };
</pre>

<H3>3.4.5 struct sigaction</H3>

<p>
The following structure defines the action to take for given signal:
<pre>
    struct sigaction
    {
      union
      {
        void (*_sa_handler)(int);
        void (*_sa_sigaction)(int, siginfo_t *, void *);
      } sa_u;
      sigset_t           sa_mask;
      int                sa_flags;
    };
    #define sa_handler   sa_u._sa_handler
    #define sa_sigaction sa_u._sa_sigaction
</pre>

<H3>3.4.6 struct siginfo/siginfo_t</H3>

<p>
The following types is used to pass parameters to/from signal
handlers:
<pre>
    typedef struct siginfo
    {
      int          si_signo;
      int          si_code;
      union sigval si_value;
   } siginfo_t;
</pre>

<H3>3.4.7 union sigval</H3>

<p>
This defines the type of the struct siginfo si_value field and
is used to pass parameters with signals.
<pre>
    union sigval
    {
      int   sival_int;
      void *sival_ptr;
    };
</pre>

<H3>3.4.8 struct sigevent</H3>

<p>
The following is used to attach a signal to a message queue to
notify a task when a message is available on a queue.
<pre>
    struct sigevent
    {
      int          sigev_signo;
      union sigval sigev_value;
      int          sigev_notify;
    };
</pre>

<H3>3.4.9 Watchdog Data Types</H3>

<p>
  When a watchdog expires, the callback function with this
  type is called:
</p>
<pre>
    typedef void (*wdentry_t)(int argc, ...);
</pre>
<p>
  Where argc is the number of uint32 type arguments that follow.
</p>
  The arguments are passed as uint32 values.
  For systems where the sizeof(pointer) &lt; sizeof(uint32), the
  following union defines the alignment of the pointer within the
  uint32.  For example, the SDCC MCS51 general pointer is
  24-bits, but uint32 is 32-bits (of course).
</p>
<pre>
    union wdparm_u
    {
      void   *pvarg;
      uint32 *dwarg;
    };
    typedef union wdparm_u wdparm_t;
</pre>
<p>
  For most 32-bit systems, pointers and uint32 are the same size
  For systems where sizeof(pointer) > sizeof(uint32), we will
  have to do some redesign.
</p>

<h1><a name="FileSystem">2.10 Filesystem Interfaces</a></h1>
<p>
  The NuttX filesystem is very simple; it does not involve any block drivers or
  particular filesystem (like FAT or EXT2 etc.).
  The NuttX filesystem simply supports a set a filesystem APIs
  (<code>open()</code>, <code>close()</code>, <code>read()</code>, <code>write</code>, etc.)
  and a registration mechanism that allows devices drivers to a associated with <i>nodes</i>
  in a file-system-like name space.
</p>

<h2><a name="driveroperations">2.10.1 Driver Operations</a></h2>
<ul><pre>
  #include &lt;fcntl.h&gt;
  int open(const char *path, int oflag, ...);
</pre></ul>

<ul><pre>
  #include &lt;unistd.h&gt;
  int   close(int fd);
  int   dup(int fildes);
  int   dup2(int fildes1, int fildes2);
  off_t lseek(int fd, off_t offset, int whence);
  int   read(int fd, void *buf, unsigned int nbytes);
  int   unlink(const char *path);
  int   write(int fd, const void *buf, unsigned int nbytes);
</pre></ul>

<ul><pre>
  #include &lt;sys/ioctl.h&gt;
  int    ioctl(int fd, int req, unsigned long arg);
</pre></ul>

<h2><a name="directoryoperations">2.10.2 Directory Operations</a></h2>
<ul><pre>
  #include &lt;dirent.h&gt;
  int        closedir(DIR *dirp);
  FAR DIR   *opendir(const char *path);
  FAR struct dirent *readdir(FAR DIR *dirp);
  int        readdir_r(FAR DIR *dirp, FAR struct dirent *entry, FAR struct dirent **result);
  void       rewinddir(FAR DIR *dirp);
  void       seekdir(FAR DIR *dirp, int loc);
  int        telldir(FAR DIR *dirp);
</pre></ul>

<h2><a name="standardio">2.10.3 Standard I/O</a></h2>
<ul><pre>
  #include &lt;stdio.h&gt;
  int    fclose(FILE *stream);
  int    fflush(FILE *stream);
  int    feof(FILE *stream);                               /* Prototyped but not implemented */
  int    ferror(FILE *stream);                             /* Prototyped but not implemented */
  int    fgetc(FILE *stream);
  char  *fgets(char *s, int n, FILE *stream);
  FILE  *fopen(const char *path, const char *type);
  int    fprintf(FILE *stream, const char *format, ...);
  int    fputc(int c, FILE *stream);
  int    fputs(const char *s, FILE *stream);
  size_t fread(void *ptr, size_t size, size_t n_items, FILE *stream);
  int    fseek(FILE *stream, long int offset, int whence); /* Prototyped but not implemented */
  size_t fwrite(const void *ptr, size_t size, size_t n_items, FILE *stream);
  char  *gets(char *s);

  int    printf(const char *format, ...);
  int    puts(const char *s);
  int    rename(const char *source, const char *target);
  int    sprintf(char *dest, const char *format, ...);
  int    ungetc(int c, FILE *stream);
  int    vprintf(const char *s, va_list ap);
  int    vfprintf(FILE *stream, const char *s, va_list ap);
  int    vsprintf(char *buf, const char *s, va_list ap);

  int    chdir(const char *path);                          /* Prototyped but not implemented */
  FILE  *fdopen(int fd, const char *type);
  int    fstat(int fd, FAR struct stat *buf);              /* Prototyped but not implemented */
  char  *getcwd(FAR char *buf, size_t size);               /* Prototyped but not implemented */
  int    mkdir(const char *path, mode_t mode);
  int    rmdir(const char *path);
  int    stat(const char *path, FAR struct stat *buf);
  int    statfs(const char *path, FAR struct statfs *buf); /* Prototyped but not implemented */
</pre></ul>

<h1><a name="index">Index</a></h1>
<ul>
  <li><a href="#clockgetres">clock_getres</a></li>
  <li><a href="#clockgettime">clock_gettime</a></li>
  <li><a href="#ClocksNTimers">Clocks</a></li>
  <li><a href="#clocksettime">clock_settime</a></li>
  <li><a href="#Data_Structures">Data structures</a></li>
  <li><a href="#directoryoperations">Directory operations</a></li>
  <li><a href="#driveroperations">Driver operations</a></li>
  <li><a href="#exit">exit</a></li>
  <li><a href="#FileSystem">Filesystem interfaces</a></li>
  <li><a href="#getpid">getpid</a></li>
  <li><a href="#gmtimer">gmtime_r</a></li>
  <li><a href="#Introduction">Introduction</a>
  <li><a href="#kill">kill</a></li>
  <li><a href="#localtimer">localtime_r</a></li>
  <li><a href="#Message_Queue">Named Message Queue Interfaces</a>
  <li><a href="#mktime">mktime</a></li>
  <li><a href="#mqclose">mq_close</a></li>
  <li><a href="#mqgetattr">mq_getattr</a></li>
  <li><a href="#mqnotify">mq_notify</a></li>
  <li><a href="#mqopen">mq_open</a></li>
  <li><a href="#mqreceive">mq_receive</a></li>
  <li><a href="#mqsend">mq_send</a></li>
  <li><a href="#mqsetattr">mq_setattr</a></li>
  <li><a href="#mqtimedreceive">mq_timedreceive</a></li>
  <li><a href="#mqtimedsend">mq_timedsend</a></li>
  <li><a href="#mqunlink">mq_unlink</a></li>
  <li><a href="#OS_Interfaces">OS Interfaces</a>
  <li><a href="#Pthread">Pthread Interfaces</a>
  <li><a href="#pthreadattrdestroy">pthread_attr_destroy</a></li>
  <li><a href="#pthreadattrgetinheritsched">pthread_attr_getinheritsched</a></li>
  <li><a href="#pthreadattrgetschedparam">pthread_attr_getschedparam</a></li>
  <li><a href="#pthreadattrgetschedpolicy">pthread_attr_getschedpolicy</a></li>
  <li><a href="#pthreadattrgetstacksize">0 pthread_attr_getstacksize</a></li>
  <li><a href="#pthreadattrinit">pthread_attr_init</a></li>
  <li><a href="#pthreadattrsetinheritsched">pthread_attr_setinheritsched</a></li>
  <li><a href="#pthreadattrsetschedparam">pthread_attr_setschedparam</a></li>
  <li><a href="#pthreadattrsetschedpolity">pthread_attr_setschedpolicy</a></li>
  <li><a href="#pthreadattrsetstacksize">pthread_attr_setstacksize</a></li>
  <li><a href="#pthreadbarrierattrinit">pthread_barrierattr_init</a></li>
  <li><a href="#pthreadbarrierattrdestroy">pthread_barrierattr_destroy</a></li>
  <li><a href="#pthreadbarrierattrgetpshared">pthread_barrierattr_getpshared</a></li>
  <li><a href="#pthreadbarrierattrsetpshared">pthread_barrierattr_setpshared</a></li>
  <li><a href="#pthreadbarrierdestroy">pthread_barrier_destroy</a></li>
  <li><a href="#pthreadbarrierinit">pthread_barrier_init</a></li>
  <li><a href="#pthreadbarrierwait">pthread_barrier_wait</a></li>
  <li><a href="#pthreadcancel">pthread_cancel</a></li>
  <li><a href="#pthreadconaddrinit">pthread_condattr_init</a></li>
  <li><a href="#pthreadcondbroadcast">pthread_cond_broadcast</a></li>
  <li><a href="#pthreadconddestroy">pthread_cond_destroy</a></li>
  <li><a href="#pthreadcondinit">pthread_cond_init</a></li>
  <li><a href="#pthreadcondsignal">pthread_cond_signal</a></li>
  <li><a href="#pthreadcondtimedwait">pthread_cond_timedwait</a></li>
  <li><a href="#pthreadcondwait">pthread_cond_wait</a></li>
  <li><a href="#pthreadcreate">pthread_create</a></li>
  <li><a href="#pthreaddetach">pthread_detach</a></li>
  <li><a href="#pthreadexit">pthread_exit</a></li>
  <li><a href="#pthreadgetschedparam">pthread_getschedparam</a></li>
  <li><a href="#pthreadgetspecific">pthread_getspecific</a></li>
  <li><a href="#Pthread"><i>pthreads</i></a> share some resources.
  <li><a href="#pthreadjoin">pthread_join</a></li>
  <li><a href="#pthreadkeycreate">pthread_key_create</a></li>
  <li><a href="#pthreadkeydelete">pthread_key_delete</a></li>
  <li><a href="#pthreadkill">pthread_kill</a></li>
  <li><a href="#pthreadmutexattrdestroy">pthread_mutexattr_destroy</a></li>
  <li><a href="#pthreadmutexattrgetpshared">pthread_mutexattr_getpshared</a></li>
  <li><a href="#pthreadmutexattrinit">pthread_mutexattr_init</a></li>
  <li><a href="#pthreadmutexattrsetpshared">pthread_mutexattr_setpshared</a></li>
  <li><a href="#pthreadmutexdestrory">pthread_mutex_destroy</a></li>
  <li><a href="#pthreadmutexinit">pthread_mutex_init</a></li>
  <li><a href="#pthreadmutexlock">pthread_mutex_lock</a></li>
  <li><a href="#pthreadmutextrylock">pthread_mutex_trylock</a></li>
  <li><a href="#pthreadmutexunlock">pthread_mutex_unlock</a></li>
  <li><a href="#pthreadocndattrdestroy">pthread_condattr_destroy</a></li>
  <li><a href="#pthreadonce">pthread_once</a></li>
  <li><a href="#pthreadself">pthread_self</a></li>
  <li><a href="#pthreadsetcancelstate">pthread_setcancelstate</a></li>
  <li><a href="#pthreadsetschedparam">pthread_setschedparam</a></li>
  <li><a href="#pthreadsetspecific">pthread_setspecific</a></li>
  <li><a href="#pthreadsigmask">pthread_sigmask</a></li>
  <li><a href="#pthreadtestcancelstate">pthread_testcancelstate</a></li>
  <li><a href="#pthreadyield">pthread_yield</a></li>
  <li><a href="#schedgetparam">sched_getparam</a></li>
  <li><a href="#schedgetprioritymax">sched_get_priority_max</a></li>
  <li><a href="#schedgetprioritymin">sched_get_priority_min</a></li>
  <li><a href="#schedgetrrinterval">sched_get_rr_interval</a></li>
  <li><a href="#schedlockcount">sched_lockcount</a></li>
  <li><a href="#schedlock">sched_lock</a></li>
  <li><a href="#schedsetparam">sched_setparam</a></li>
  <li><a href="#schedsetscheduler">sched_setscheduler</a></li>
  <li><a href="#schedunlock">sched_unlock</a></li>
  <li><a href="#sched_yield">sched_yield</a></li>
  <li><a href="#Semaphores">Counting Semaphore Interfaces</a>
  <li><a href="#semclose">sem_close</a></li>
  <li><a href="#semdestroy">sem_destroy</a></li>
  <li><a href="#semgetvalue">sem_getvalue</a></li>
  <li><a href="#seminit">sem_init</a></li>
  <li><a href="#semopen">sem_open</a></li>
  <li><a href="#sempost">sem_post</a></li>
  <li><a href="#semtrywait">sem_trywait</a></li>
  <li><a href="#semunlink">sem_unlink</a></li>
  <li><a href="#semwait">sem_wait</a></li>
  <li><a href="#setgetscheduler">sched_getscheduler</a></li>
  <li><a href="#sigaction">sigaction</a></li>
  <li><a href="#sigaddset">sigaddset</a></li>
  <li><a href="#sigdelset">sigdelset</a></li>
  <li><a href="#sigemptyset">sigemptyset</a></li>
  <li><a href="#sigfillset">sigfillset</a></li>
  <li><a href="#sigismember">sigismember</a></li>
  <li><a href="#Signals">Signal Interfaces</a>
  <li><a href="#sigpending">sigpending</a></li>
  <li><a href="#sigprocmask">sigprocmask</a></li>
  <li><a href="#sigqueue">sigqueue</a></li>
  <li><a href="#sigsuspend">sigsuspend</a></li>
  <li><a href="#sigtimedwait">sigtimedwait</a></li>
  <li><a href="#sigwaitinfo">sigwaitinfo</a></li>
  <li><a href="#standardio">Standard I/O</a></li>
  <li><a href="#taskactivate">task_activate</a></li>
  <li><a href="#Task_Control">Task Control Interfaces</a>
  <li><a href="#taskcreate">task_create</a></li>
  <li><a href="#taskdelete">task_delete</a></li>
  <li><a href="#taskinit">task_init</a></li>
  <li><a href="#taskrestart">task_restart</a></li>
  <li><a href="#Task_Schedule">Task Scheduling Interfaces</a>
  <li><a href="#Task_Switch">Task Switching Interfaces</a>
  <li><a href="#timercreate">timer_create</a></li>
  <li><a href="#timerdelete">timer_delete</a></li>
  <li><a href="#timergetoverrun">timer_getoverrun</a></li>
  <li><a href="#timergettime">timer_gettime</a></li>
  <li><a href="#ClocksNTimers">Timers</a></li>
  <li><a href="#timersettime">timer_settime</a></li>
  <li><a href="#Watchdogs">Watchdog Timer Interfaces</a>
  <li><a href="#wdcancel">wd_cancel</a></li>
  <li><a href="#wdcreate">wd_create</a></li>
  <li><a href="#wddelete">wd_delete</a></li>
  <li><a href="#wdgettime">wd_gettime</a></li>
  <li><a href="#wdstart">wd_start</a></li>
</ul>

</BODY>
</HTML>